from collections import defaultdict, deque, Counter
from functools import cache
# import copy
from itertools import combinations, permutations, product, accumulate, groupby, chain
from heapq import heapify, heappop, heappush, heappushpop
import math
import bisect
import sys
# sys.setrecursionlimit(2000000)
input = lambda: sys.stdin.readline().rstrip('\n')
inf = float('inf')
mod1 = 10**9+7
mod2 = 998244353
def ceil_div(x, y): return -(-x//y)

#################################################   

S = list(input().split())
cnt = 0
for s in S:
    cnt += (s=="AC" or s=="NoOut")
print('Win' if cnt > 5 else 'Lose' if cnt < 5 else 'Draw')