WOJ1300-Stone

Dzs and Sproblvem love mathmatics, so when they play games they also want to find out the inner rules of the game. 
The game they played is very classic. 
There is a pile of stones, two players can pick 2,3 or 5 stones each round, if the player can't pick stones from thepile, for instance if there is only 1 stone left, he will lose the game. 
This time Sproblvem will be the "first pick" player ,he want to know if both of them play perfect who will win? 

输入格式

At the first line is a number c (1<= c <= 1025), means there will be c case.
Then follow c lines, each line have number n (0 <= n <= 1000000) represent that pile have n stones.

输出格式

For each case print one line, if Sproblvem will win the game, output "Sproblvem" otherwise output "Dzs".

样例输入

3
13
14
16

样例输出

Sproblvem
Dzs
Sproblvem

#include<stdio.h>
int main(){
    int c,n;
    scanf("%d",&c);
    while(c--){
        scanf("%d",&n);
        if(n%7==0||n%7==1)
        printf("Dzs\n");
        else
        printf("Sproblvem\n");
	}
    return 0;
}