from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
from heapq import heappop, heappush
#input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): # n=1
return int(input())
def inpm(): # x=1,y=2
return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
return list(input().split())
def inplm(n): # x=[] 複数行
return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
return sorted([list(map(int, input().split())) for _ in range(n)])
def sortx(x,n,k):
if k == 0:x.sort(key=lambda y:y[1,n])
else:x.sort(reversed=True, key=lambda y:y[1,n])
def graph():
n=inp()
g=[[] for _ in range(n)]
for i in range(n):
a=inp()
a-=1
g[i].append(a)
g[a].append(i)
return n,g
def graphm():
n,m=inpm()
g=[[] for _ in range(n)]
for _ in range(m):
a,b,w=inpm()
a-=1
b-=1
g[a].append((b,w))
g[b].append((a,w))
return n,m,g
def dijkstra(s,n,g): # sからの最短距離 頂点数n
s -= 1
que = []
d = [10**15 for _ in range(n)]
d[s] = 0
heappush( que,(0,s) )
while len(que)>0:
p = heappop(que)
v = p[1]
if d[v] < p[0]:
continue
for i in range(len(g[v])):
edge = g[v][i]
if d[edge[0]] > d[v] + edge[1]:
d[edge[0]] = d[v] + edge[1]
heappush( que,(d[edge[0]] , edge[0]) )
return d
def main():
n=int(input())
said = {}
word = []
for _ in range(n):
word.append( input() )
said[word[0]]=1
lastword=word[0][len(word[0])-1]
for i in range(1,n):
if i % 2 == 0:
if word[i] not in said:
if word[i][0]!=lastword:
print("LOSE")
return
said[word[i]]=1
lastword=word[i][len(word[i])-1]
else:
print("LOSE")
return
else:
if word[i] not in said:
if word[i][0]!=lastword:
print("WIN")
return
said[word[i]]=1
lastword=word[i][len(word[i])-1]
else:
print("WIN")
return
print("DRAW")
if __name__ == "__main__":
main()