For this Question: Naruto and Sasuke are playing a game in which they are given a binary string S. The rules of the game are given as:-
Players play in turns
The game ends when all the characters in the string are same, and the player who has the current turn wins.
The current player has to delete the i<sup>th</sup> character from the string. (1 <= i <= |S|)


If both the players play optimally and Naruto goes first, find who will win the game.The Input contains only string S.

Constraints:-
1 <= |S| <= 100000Print "Naruto" if Naruto wins else print "Sasuke".Sample Input:-
0101

Sample Output:-
Sasuke

Explanation:-
First Naruto will delete the character 0 from index 1. string:- 101
Then Sasuke will delete the character 1 from index 1. string  01
It doesn't matter which character Naruto removes now, Sasuke will definitely win.

Sample Input:-
1111

Sample Output:-
Naruto

Explanation:-
All the characters in the string are already same hence Naruto wins, I have written this Solution Code: import java.io.*;
import java.util.*;
class Main{
	public static void main(String args[])throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String s1=br.readLine();
		int N=s1.length();
		int index=0;
		int count=0;
		for(int i=N-2;i>=0;i--)
		{
			if(s1.charAt(i)!=s1.charAt(i+1))
			{
					index=i+1;
					break;

			}
		}

		if(index==N-1)
		{
			if(N%2==0)
			{
				System.out.print("Sasuke");
			}
			else{
				System.out.print("Naruto");
			}
		}

		else if(index==0)
		{
			System.out.print("Naruto");
		}
		else{
			for(int i=0;i<index;i++)
			{
				count++;
			}
			if(count%2==0)
			{
				System.out.print("Naruto");
			}
			else{
				System.out.print("Sasuke");
			}
		}
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?