普鲁士的荣耀

#include <iostream>
#include <stack>

using namespace std;

stack <int> s;

int main()
{
int n = 0;

cin >> n;

while (n)
{
	s.push(n % 2);
	n /= 2;
}

while (s.size())
{
	cout << s.top() ;
	s.pop();
}

return 0;

}