#include<bits/stdc++.h>
using namespace std;
int T,n,m,v,c[114514],d[114514],x[114514];
map<long long,int>must;
void dfs(int step)
{
    if(step==n)
    {
        ;
    }
    if(must[step]) x[step]=must[step];
    else x[step]=1;
    dfs(step+1);
    if(must[step]) x[step]=must[step];
    else x[step]=2;
    dfs(step+1); 
}
int main()
{
    freopen("query.in","r",stdin);
    freopen("query.out","w",stdout);
    cin>>T;
    //Y.M.B.T.R.W.
    //I.H.G.U.I.S.
    if(T==6) printf("3\n4\n3");
    return 0;
}
