There are N big trucks standing in a line.
Each trucks contains Mi boxes (1 <= i <= N). Each box contains distinct number of stones ranging from Xi to Xi+Mi-1.
Two players Sanjeev and Shikhar play a game. Players take turns removing stones from boxes. On each turn, a player can select any box and remove any non-zero amount of stones from it. The player who cannot remove a stone loses.
Your task is to find out which player will win, provided that both of them play optimally and Sanjeev takes the first stone.
Input:
The first line of the input contains T, the number of test cases. Each test case goes as follows:
The first line of each test case contains one integer N, the number of trucks. Then follows N lines, each of them contains two space-separated integers Xi and Mi.
Output:
Print "Sanjeev" if he wins the game otherwise output "Shikhar" (without quotes).
Constraints:
1 <= T <= 10
1 <= N <= 10^5
1 <= Xi, Mi <= 10^16
Problem Setter:
Akash Rakshit