URAL 2068. Game of Nuts

2068. Game of Nuts

Time limit: 1.0 second
Memory limit: 64 MB

The war for Westeros is still in process, manpower and supplies are coming to an end and the winter is as near as never before. The game of thrones is unpredictable so Daenerys and Stannis decided to determine the true ruler of Seven Kingdoms playing more predictable and shorter game. For example, the game of nuts is the ideal candidate.

Rules of this game are quite simple. Players are given  n heaps of nuts. There is an odd number of nuts in each heap. Players alternate turns. In each turn player chooses an arbitrary heap and divides it into three non-empty heaps so as there is again an odd number of nuts in each heap. The player who cannot make a move loses.

Daenerys has dragons so she moves first. Your task is to determine the winner assuming both Daenerys and Stannis play optimally. Please, do it and stop the war for Westeros!

Input

In the first line there is an odd integer  n (1 ≤  n ≤ 777).

In the second line there are  n integers separated by spaces. These are the amounts of nuts in each heap at the beginning of the game. It is guaranteed that each heap contains not less than one and not more than 54321 nuts and this amount is an odd number.

Output

Output "Daenerys" (without quotes) in case of Daenerys’ win. Otherwise output "Stannis".

Samples

input	output
1 3	Daenerys
3 1 1 1	Stannis
5 777 313 465 99 1	Daenerys

两个人玩游戏，有若干堆，每堆都是奇数个的坚果，选其中一堆分成非空的三份，并且也要是奇数，知道不能分的那个人就输

水题 只要计算把每一堆都分成 1 的次数就行 

//URAL 2068. Game of Nuts ©TyxMaek1997-2017
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

int main(){

    int n;
	cin>>n;
	int sum=0;
	while (n--)
	{
		int a;
		cin>>a;
		sum+=a/2;
	}
	if(sum%2==0)
		cout<<"Stannis\n";
	else
		cout<<"Daenerys\n";

		return 0;
}