require 'tsort'

class Hash
  include TSort
  alias tsort_each_node each_key
  def tsort_each_child(node, &block)
    self[node].each(&block)
  end
end

idx = Hash[%w(
   Rock Fire Scissors Snake Human Tree Wolf Sponge Paper Air Water Dragon Devil Lightning Gun
).map.with_index {|g, i| [g, i] }]

loop do
  n = gets.to_i
  break if n == 0
  gestures = (1..n).map { gets.chomp }.uniq

  if gestures.size == 1
    puts 'Draw'
    next
  end

  graph = Hash[gestures.map {|g| [g, []] }]
  gestures.permutation(2) do |g1, g2|
    i, j = idx[g1], idx[g2]
    graph[g1] << g2 if (i - j) % 15 <= 7
  end

  begin
    sorted = graph.tsort
    puts sorted[0]
  rescue TSort::Cyclic
    puts 'Draw'
  end
end
