#include <iostream>
#include <cassert>
#include <cmath>
using namespace std;
int main(){
	long long n;
	cin >> n;

	for(long long k = ceil(sqrt(n)); 2*k-1 <= n; ++k){
		long long s = sqrt(k*k-n);
		if(s*s == k*k-n){
			cout << k << ' ' << s << endl;
			return 0;
		}
	}
	cout << "impossible\n";
}