#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define debug(x) cout << #x << " = " << x << endl
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
inline ll Mod(ll x, ll mod) { return x % mod >= 0 ? x % mod : x % mod + mod; }

vector<ll> primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};

void find_primes(int n)
{
    for (int i = 51; i <= n; i += 2)
    {
        bool flag = 0;
        for (int j : primes)
        {
            if (j * j > i)
                break;
            if (i % j == 0)
            {
                flag = 1;
                break;
            }
        }
        if (!flag)
            primes.emplace_back(i);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    primes.reserve(20000);
    find_primes(24000);
    int n;
    cin >> n;
    int ansa = 0, ansb = 0, MAX = 0;
    for (int a = -n; a <= n; a++)
    {
        for (int b = -n; b <= n; b++)
        {
            int cnt = 0;
            while (binary_search(all(primes), cnt * cnt + cnt * a + b))
            {
                cnt++;
            }
            if (MAX < cnt)
            {
                ansa = a;
                ansb = b;
                MAX = cnt;
            }
        }
    }
    cout << ansa << " " << ansb;
}

from math import sqrt
from itertools import count,islice
def primes(n):
    numbers=set(range(n-1,1,-1))
    prime=[]
    while numbers:
        k=numbers.pop()
        prime.append(k)
        numbers.difference_update(set(range(k*2,n,k)))
    return prime
def check(n):
    return n>1 and all(n%i for i in islice(count(2),int(sqrt(n))-1))
def conset(ab):
    a,b=ab[0],ab[1]
    for i in count():
        n=i*(i+a)+b
        if not check(n):
            return i
n=int(input())
b=primes(n)
a=list(range(-n,n+1,2)) if n&1 else list(range(-n+1,n,2))
s=max(((i,j) for i in a for j in b),key=conset)
print(str(s[0]),str(s[1]))

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

vector<int> prime;
vector<bool> mark2(2001, true);

void sieve() {
    int limit = floor(sqrt(2000)) + 1;
    vector<bool> mark1(limit+1, true);
    for (int i=2; i<=limit; i++) {
        if (mark1[i]) {
            prime.push_back(i);
            for (int j=2*i; j<=limit; j+=i) {
                mark1[j] = false;
            }
        }
    }
    mark2[0] = false, mark2[1] = false;
    for (int i=0; prime[i]; i++)
        for (int j=2*prime[i]; j<=2000; j+=prime[i])
            mark2[j] = false;
}

int main() {
    sieve();
    int n, max_c = 0, val_a, val_b; cin >> n;
    for (int b=-n; b<n; b++) {
        for (int a=-n; a<n; a++) {
            int c = 0;
            while (c*c + a*c + b > 0 && mark2[c*c + a*c + b]) c += 1;
            if (max_c < c) {
                max_c = c;
                val_a = a;
                val_b = b;
            }
        }
    }

    cout << val_a << " " << val_b << "\n";
}