0000

#include <bits/stdc++.h>

using namespace std;
int a[110];
int idx = -1;

//出栈 
int pop()
{
	idx--;
	return a[idx+1];
}

//压栈
int push(int x)
{
	idx++;
	a[idx] = x;
}

int main(void)
{
	int n;
	cin >> n;
	while (N!=0)
	{
		push(N%2);
		N=N/2;
	}
	while(idx>=0)
	{
		cout<<pop();
	}
}