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

int main()
{
  long double n;
  cin >> n;
  
  long double a, b, ansA = -1, ansB = -1;
  for (long double i = 1;; i++) {
    a = powl(3, i);
    if (a > n) break;
    for (long double j = 1;; j++) {
      b = powl(5, j);
      if (b > n) break;
      if (a + b  == n) {
        ansA = i;
        ansB = j;
        break;
      }
    }
  }
  
  if (ansA == -1) {
    cout << -1 << endl;
  } else {
    cout << ansA << " " << ansB << endl;
  }
}
#include <bits/stdc++.h>
#include<random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
const lint MOD = 1e9 + 7, INF = 1e18;
lint dx[8] = { 0, -1, 1, 0, 1, -1, 1, -1 }, dy[8] = { 1, 0, 0, -1, -1, -1, 1, 1 };
typedef pair<long double, lint> Pa;
typedef pair<lint, plint> tlint;
struct edge {
	lint cost;
	lint u, v;
};

lint N;
int main() {
	cin >> N;
	lint cnt3 = 1;
	lint curr = 3;
	while (true) {
		lint _curr = 5;
		lint cnt5 = 1;
		while (true) {
			if (curr + _curr == N) {
				cout << cnt3 << " " << cnt5 << endk;
				return 0;
			}
			if (_curr > N/ 5) break;
			cnt5++;
			_curr *= 5;
		}
		if (curr > N / 3) break;
		cnt3++;
		curr *= 3;
	}
	cout << -1 << endk;
}