HDU 2053 JAVA

Problem Description
There are many lamps in a line. All of them are off at first. A series of operations are carried out on these lamps. On the i-th operation, the lamps whose numbers are the multiple of i change the condition ( on to off and off to on ).

Input
Each test case contains only a number n ( 0< n<= 10^5) in a line.

Output
Output the condition of the n-th lamp after infinity operations ( 0 - off, 1 - on ).

Sample Input
1
5

Sample Output
1
0

import java.util.*;class Main{  public static void main(String args[]){    Scanner sc=new Scanner(System.in);    while(sc.hasNext()){      int n=sc.nextInt();      int m=(int)Math.sqrt(n);      if(n==m*m){        System.out.println("1");      }else{        System.out.println("0");      }    }  }}