/*   @JUDGE_ID:   1705PZ   10862   C */
#include <stdio.h>

main()
{
	int i, j, k, n;
	int len[4001];
	long long tmp, t[4001][70];

	/* t[0] = t[1] = 1; */
	t[0][0] = 0;
	t[1][0] = 1;

	len[0] = len[1] = 1;

	for( i = 2; i <= 4000; i++) {

		t[i][0] = 0;

		/* t[i] = t[i - 1] + t[i - 2] */
		for(k = 0; k < len[i - 1]; k++) {
			tmp = t[i - 1][k] + t[i - 2][k];
			t[i][k + 1] = tmp / 1000000000000000000LL;
			t[i][k] += tmp % 1000000000000000000LL;
		}

		len[i] = len[i - 1];
		if( t[i][len[i]] != 0 ) {
			len[i]++;
		}
	}

	while(1) {
		scanf("%d", &n);
		if( n == 0 ) {
			break;
		}

		/* show t[2 * n] */
		n <<= 1;
		for(k = len[n]; k >= 0 && t[n][k] == 0; k--);
		printf("%lld", t[n][k--]);
		for(; k >= 0; k--) {
			printf("%018lld", t[n][k]);
		}
		printf("\n");
	}
}