#include<bits/stdc++.h>
#include<iostream>
#define LL long long
#define GG int
#define For(i, j, k) for(int i=j; i<=k; i++)
#define Dow(i, j, k) for(int i=j; i>=k; i--)
inline GG read() {
GG x = 0, f = 1;
char ch = getchar();
while(ch<'0'||ch>'9') { if(ch=='-') f = -1; ch = getchar(); }
while(ch>='0'&&ch<='9') { x = x*10+ch-48; ch = getchar(); }
return x * f;
}
const int N = 10;
int n, m, num;
LL f[50][50], ans;
inline int ma(int x, int y) {
if(x > y) return x;
return y;
}
int main() {
int T = 0, x;
For(i, 0, 35) f[0][i] = 1;
For(i, 1, 35)
For(j, i, 35) {
if(i==j) f[i][j] = f[i-1][j];
else f[i][j] = f[i-1][j] + f[i][j-1];
}
while(~scanf("%d", &n)) {
++T;
if(n==-1) return 0;
printf("%d %d %lld\n", T, n, f[n][n]*2);
}
return 0;
}