def dfs(N,n):
	if n == N:return 1
	if n > N:return 0
	return dfs(N,n + 1) + dfs(N,n + 2)
N = int(raw_input())
print dfs(N,0)