UVa 11428

#include<bits/stdc++.h>
using namespace std;

typedef long long int       ll;
typedef unsigned long long int  ull;
typedef vector<int>         vi;
typedef vector<ll>          vll;
typedef vector<vi>          vvi;
typedef pair<int,int >      pii;
typedef vector< pii >       vpii;
typedef set<int>            sti;

#define sc                  scanf
#define pf                  printf
#define sci(n)              scanf("%d",&n)
#define scl(n)              scanf("%I64d",&n)
#define scf(n)              scanf("%lf",&n)
#define pfi(n)              printf("%d",n)
#define pfl(n)              printf("%I64d",n)
#define pff(n)              cout<<n
#define line                printf("\n")
#define spc                 printf(" ")
#define loop(i,x,y)         for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)        for(int i=int(y); i>=int(x); i--)
#define cspf(i)             printf("Case %d: ", i)
#define pb                  push_back
#define mp                  make_pair
#define ff                  first
#define ss                  second
#define all(v)              v.begin(),v.end()
#define rall(v)             v.rbegin(),v.rend()
#define read()              freopen("input.txt", "r", stdin)
#define write()             freopen("output.txt", "w", stdout)
/// Constants
#define eps                 1e-9
#define PI                  acos(-1.0)  // 3.1415926535897932

int main()
{
    int n;
    while(1){
        sci(n);
        if(n==0) break;
        int flg=0;
        loop(i,1,100){
            loop(j,0,i){
                if(i*i*i-j*j*j==n){
                    pfi(i);spc;pfi(j);line;
                    flg=1;
                    break;
                }
            }
            if(flg==1)
                break;
        }
        if(flg==0)
            pf("No solution\n");
    }
    return 0;
}