#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=5e5+5e3;
const int inf=1e9;
int read(){
	int a=0;
	char ch=getchar();
	while(ch<'0'||'9'<ch) ch=getchar();
	while('0'<=ch&&ch<='9'){
		a=(a<<1)+(a<<3)+(ch^48);
		ch=getchar();
	}
	return a;
}
struct subtree{
	struct STL{
		int l,r;
		int minn,maxx;
	}t[maxn*4];
	int a[maxn];
	void pushup(int p){
		t[p].minn=min(t[p*2].minn,t[p*2+1].minn);
		t[p].maxx=min(t[p*2].maxx,t[p*2+1].maxx);
	}
	void build(int p,int l,int r){
		t[p].l=l;t[p].r=r;
		if(l==r){
			t[p].minn=a[l];
			t[p].maxx=a[l];
			return ;
		}
		int mid=(l+r)/2;
		build(p*2,l,mid);
		build(p*2+1,mid+1,r);
		pushup(p);
	}
	int askmax(int p,int l,int r){
		if(l<=t[p].l&&t[p].r<=r){
			return t[p].maxx;
		}
		int ans=0,mid=(l+r)/2;
		if(t[p].l<=mid) ans=max(ans,askmax(p*2,l,mid));
		if(mid<t[p].r) ans=max(ans,askmax(p*2+1,mid+1,r));
		return ans;
	}
	int askmin(int p,int l,int r){
		if(l<=t[p].l&&t[p].r<=r){
			return t[p].minn;
		}
		int ans=inf,mid=(l+r)/2;
		if(t[p].l<=mid) ans=min(ans,askmin(p*2,l,mid));
		if(mid<t[p].r) ans=min(ans,askmin(p*2+1,mid+1,r));
		return ans;
	}
}at;
struct rec{
	int v,nxt;
}en[maxn*2];
int tot=1,fi[maxn];
void add(int u,int v){
	en[++tot].v=v;en[tot].nxt=fi[u];fi[u]=tot;
	return ;
}
int fa[maxn],son[maxn],siz[maxn],dfn[maxn],deep[maxn];
int toop[maxn];
int num=0,bianhao=0;
void dfs1(int u,int f){
	son[u]=0;
	fa[u]=f;
	siz[u]=1;
	deep[u]=deep[f]+1;
	for(int i=fi[u];i;i=en[i].nxt){
		int v=en[i].v;
		if(v!=f){
			dfs1(v,u);
			siz[u]+=siz[v];
			if(son[u]==0||siz[v]>siz[son[u]]) son[u]=v;
		}
	}
	return ;
}
void dfs2(int u,int topp){
	toop[u]=topp;
	dfn[u]=++bianhao;
	if(son[u]) dfs2(son[u],topp);
	for(int i=fi[u];i;i=en[i].nxt){
		int v=en[i].v;
		if(!dfn[v]){
			dfs2(v,v);
		}
	}
	return ;
}
int findfa(int x,int y){
	while(toop[x]!=toop[y]){
		if(dfn[toop[x]]>dfn[toop[y]]) swap(x,y);
		y=fa[toop[y]];
	}
	if(dfn[x]>dfn[y]) swap(x,y);
	return deep[x]-1;
}
int main(){
	freopen("traverse.in","r",stdin);
	freopen("traverse.out","w",stdout);
	int n=read();
	while(n--){
		printf("114514\n");
	}
	return 0;
}
