#include <iostream>

 #include <stack>

 int main()

 {

     int num;

     std::stack<int>mystack;

     std::cin >> num;

     for (; num; num /= )

     {

         mystack.push(num % );//入栈

         std::cout << "当前元素个数" << mystack.size() << std::endl;

     }

     while (!mystack.empty())

     {

         std::cout << mystack.top() << " ";//返回栈顶元素

         mystack.pop();//出栈

     }

     return ;

 }