#include <bits/stdc++.h>
using namespace std;
#define uint unsigned long long
#define int long long
#define endl '\n'
const int N = 1e4 + 5;
typedef pair<int, int> PII;
#define MAX LONG_LONG_MAX

int a[N], b[N], c[N];
void solve()
{

    uint k, x;
    cin >> k;
    if (k % 2 == 0)
    {
        cout << -1 << endl;
        return;
    }
    x = (k + 1) / 2;
    cout << x << " ";
    int idx = 1;
    while (k)
    {
        a[idx++] = k % 10;
        k /= 10;
    }
    int lena = idx - 1; // 每个部分都很清楚
    idx = 1;
    while (x)
    {
        b[idx++] = x % 10;
        x /= 10;
    }
    int lenb = idx - 1;
    int i, j;
    for (i = 1; i <= lenb; i++)
        for (j = 1; j <= lena; j++)
            c[i + j - 1] += a[j] * b[i];
    for (i = 1; i < lena + lenb; i++)
        if (c[i] > 9)
        {
            c[i + 1] += c[i] / 10;
            c[i] %= 10;
        }
    int len = len = lena + lenb;
    while (c[len] == 0 && len > 1)
        len--;
    for (i = len; i >= 1; i--)
        cout << c[i];
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    solve();
    return 0;
}