#include
#define n 200
void tian(int(*p)[n])
{
int i, j
int mn=p[n-1][n-1]
for (i=0i<mn++i)
{
for (j=0j<mn++j)
{
if ((i+j==mn-1))
{
p[i][j]=1
continue
}
if ((i+j>mn-1))
{
p[i][j]=2
continue
}
if ((i+j<mn-1))
{
p[i][j]=3
continue
}
}
}
}
int main()
{
int a[n][n]
int i, j
int len
scanf("%d", &len)
a[n-1][n-1]=len
tian(a)
for (i=0i<len++i)
{
for (j=0j<len++j)
printf("%2d", a[i][j])
printf("\n")
}
return 0
}
main(){
int a[22]
int i,j
for(i=0i<21i++)a[i]=1
j=0
int f,s
int n
scanf("%d",&n)
for(i=1i++)
{
NA:
j++
if(j==22)j=1//j的值是1～21
if(a[j]==0)goto NA
if(i==n)
{
a[j]=0
printf("j=%d\n",j)
s=0
for(f=0f<22f++)
{
s+=a[f]
}
if(s==1)break
i=0
}
}
for(f=0f<22f++)
{
if(a[f]==1)
printf("%d\n",f)
}
}
