#include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<queue>

 #include<algorithm>

 using namespace std;

 typedef long long ll;

 ll kuaisumi(int a,int b){

     ll ans=;

     while(b!=){

         if(b%==)

             ans=ans*a;

             a=a*a;

             b=b/;

     }

     return ans;

 }

 int main(){

     ll n;

     cin>>n;

     if(n==||n==)cout<<"-1"<<endl;

     else{

         int num=;

         while(n>&&n%==){

             num++;

             n/=;

         }

         //cout<<num<<endl;

         ll cnt=kuaisumi(,num);

         if(n%==)cout<<n*n/*cnt<<" "<<(n*n/+)*cnt<<endl;

         else if(n%==)cout<<*cnt<<" "<<*cnt<<endl;

         else if(n%==)cout<<*cnt<<" "<<*cnt<<endl;

     }

 }