#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

typedef pair<string,string> P;
const int DRAW = 0;
const int WIN = 1;
const int LOSE = 2;
string s[15] = {"Rock", "Fire", "Scissors", "Snake", "Human", "Tree", "Wolf", "Sponge", "Paper", "Air", "Water", "Dragon", "Devil", "Lightning", "Gun"};
map<string,int> m;
int h[15][15] = {0};

int main(){
	for(int i=0 ; i < 15 ; i++ ){
		m[s[i]] = i;
		for(int j=i+1 ; j <= i+7 ; j++ ){
			h[i][j%15] = WIN;
			h[j%15][i] = LOSE;
		}
	}
	
	int n;
	while( cin >> n, n ){
		vector<string> hand(n);
		string ans;
		
		for(int i=0 ; i < n ; i++ ){
			cin >> hand[i];
		}
		for(int i=0 ; i < n ; i++ ){
			int win=0, lose=0, draw=0;
			
			for(int j=0 ; j < n ; j++ ){
				int res = h[m[hand[i]]][m[hand[j]]];
				if( res == LOSE ){
					lose++;
					break;
				}
				if( res == WIN ) win++;
				if( res == DRAW ) draw++;
			}
			if( lose == 0 && win > 0 ) ans = hand[i];
		}
		if( ans.empty() ){
			cout << "Draw" << endl;
		}else{
			cout << ans << endl;
		}
	}
}