18441 偷懒的士兵

#include<iostream>
using namespace std;
typedef long long ll;
ll f(ll n)
{
	if(n<=3) return n%3==0?0:n;
	if(n%2==0) return 2*f(n/2);
	else  return f((n+1)/2)+f(n/2);
}
int main()
{
	ll n;
	while(cin>>n && n)
	{
		cout<<f(n)<<endl;
	}
	return 0;
 }