1 #include<cstdio>
 2 #include<algorithm>
 3 #include<cstring>
 4 #include<iostream>
 5 using namespace std;
 6 const int N = 999;
 7 int sg[1001];
 8 int dfs(int x){
 9     if(sg[x] != -1)return sg[x];
10     bool g[1001] = {0};
11     int tp = dfs(x-1);
12      for(int i=1;i<=x;i++){
13         dfs(x-i);
14         g[sg[x-i]]=1;
15     }
16 
17     for(int i = 1;i<(x)/2+1;i++){
18         int t = dfs(i)^dfs(x-i);
19         g[t] = 1;
20     }
21     for(int i = 0;;i++){
22         if(!g[i])return sg[x] = i;
23     }
24 }
25 int main()
26 {
27 #ifdef LOCALL
28     //freopen("in2.txt","r",stdin);
29     freopen("out.txt","w",stdout);
30 #endif
31     memset(sg,-1,sizeof sg);
32     dfs(N);
33     for(int i = 0;i<N;i++){
34         cout<<sg[i]<<endl;
35     }
36 
37     return 0;
38 }