#include <iostream>
using namespace std;
int ans;
long long a[114514];//臭数组
int f(int n)
{
	if(a[n] != 0)return a[n];
	int ans=1;
	for(int i=1;i<=n/2;i++)ans+=f(i);
	a[n]=ans;
	return ans;
}
int main()
{
	int n;
	cin>>n;
	cout<<f(n)<<endl;
	return 0;
}