// backtracking solution of 2 ^ N time complexity

#define _CRT_SECURE_NO_DEPRECATE
#include <stdio.h>
#include <string.h>
#include <assert.h>

#define MAXN 25
#define scale 0.000001

int N;

int main()
{
	assert(freopen("dezastru.in", "r", stdin));
	freopen("dezastru.out", "w", stdout);

	scanf("%d", &N);

	for (int i = 1; i < 1 << N; ++i);

	return 0;
}