杭电2053

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

#include<iostream>
#include<string.h>
using namespace std;

int main()
{
	int a[100005];
	memset(a,0,sizeof(a));
	int n;
	while(cin>>n){
		int num = 0;
	for(int i=1;i<=n;i++){
		if(n%i==0){
			num++;
		}
	}
	if(num%2==0){
		cout<<"0"<<endl;
	}else{
		cout<<"1"<<endl;
	}
	}
	return 0;
 }