import java.io.*;
import java.util.*;

public class hyperrsp_yuizumi {
	private static final String[] hands;
	private static final Map<String,Integer> handsMap;
	private static final int m;

	static {
		hands = ( "Rock,Gun,Lightning,Devil,Dragon,Water,Air,Paper,Sponge,"
				+ "Wolf,Tree,Human,Snake,Scissors,Fire" ).split(",");

		m = hands.length;

		handsMap = new HashMap<String,Integer>();
		for(int i = 0; i < m; i++) { handsMap.put(hands[i], i); }
	}

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while(doCase(cin)) ;
	}

	private static boolean doCase(Scanner cin) {
		int n = cin.nextInt();

		if(n == 0)
			return false;

		boolean[] occur = new boolean[m];
		Arrays.fill(occur, false);

		for(int i = 0; i < n; i++)
			occur[handsMap.get(cin.next())] = true;

		int winner = -1;
		
		for(int i = 0; i < m; i++) {
			boolean isWinner = false;

			for(int j = 1; j <= m / 2; j++)
				isWinner = isWinner ||  occur[(i - j + m) % m];
			for(int j = 1; j <= m / 2; j++)
				isWinner = isWinner && !occur[(i + j + m) % m];

			if(isWinner && occur[i]) {
				if(winner >= 0) throw new RuntimeException("somthing wrong");
				winner = i;
			}
		}

		if(winner >= 0)
			System.out.println(hands[winner]);
		else
			System.out.println("Draw");

		return true;
	}
}