#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int MAX=;

 int sg[MAX];

 bool save[MAX];

 int get(int len){

     for(int i=;i<MAX;i++)

     if(!save[i]) return i;

 }

 int main(){

     int mid; int len,a,b,ans;

     sg[]=;sg[]=sg[]=sg[]=;

     for(int i=;i<=;i++){

             memset(save,false,sizeof(save));

             len=;

             if(i&) mid=i/+;

             else mid=i/;

             for(int k=;k<=mid;k++){

                     a=k-; b=i-k-;

                     if(a<) a=;

                     if(b<) b=;

                     ans=sg[a]^sg[b];

                     save[ans]=true;

             }

             sg[i]=get(len);

     }

  //   for(int i=1;i<=15;i++)

  //   printf("%d ",sg[i]);

     int n;

     while(scanf("%d",&n)!=EOF){

     if(sg[n]) printf("1\n");

     else printf("2\n");

     }

     return ;

 }