#include<iostream>

 #include<algorithm>

 #include<cmath>

 using namespace std;

 int main()

 {

     int n,a,b,c,count,k,s[],i;

     while(cin >> n && n){

         count=;

         for(int k=;k<=n;k*=){

             c=(n/k)/;

             b=n/k-c*;

             if((b!=||c!=)&&b<)

             {

                 a=(n-b*k-c**k)/;

                 if(*a+b*k+c**k==n)

                     s[count++]=a+b*k+c**k;

             }

             b--;

             if((b!=||c!=)&&b>=)

             {

                 a=(n-b*k-c**k)/;

                 if(*a+b*k+c**k==n)

                     s[count++]=a+b*k+c**k;

             }

         }

         if(count==)    cout << "No solution." << endl;

         else{

             sort(s,s+count);

             cout << s[];

             for(int i=;i<count;++i)

                 if(s[i]!=s[i-])

                 cout << " " << s[i];

             cout << endl;

         }

     }

     return ;

 }