#include "bits/stdc++.h"
using namespace std;
#define fastcin {\
    cin.tie(0);\
    ios::sync_with_stdio(false);\
}
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rrep(i, a, b) for(int i = a; i >= b; i--)
#define fore(i, a) for(auto &i:a)
#define print(x) cout << x << "\n"
#define SORT(a, n) sort(a, a+n);
#define REVERSE(a,n) reverse(a,a+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VREVERSE(v) reverse(v.begin(), v.end());
#define MOD 1000000007
#define yes "YES"
#define no "NO"
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

bool pmod(string s, int m, int p) {
    int size = s.size(), tmp = 0;
    rep(i, 0, size) {
        tmp = (tmp*p + s[i]-'0') % m;
    }
    bool b;
    if(tmp) b = false;
    else b = true;
    return b;
}

bool dp[1][1] = {};
void solve_dp(int n, int k, vi a) {
    rep(i, 0, n) {
        rep(j, 0, k+1) {
            if(dp[i][j]) {
                dp[i+1][j] = true;
                if((j+a[i])<=k) {
                    dp[i+1][j+a[i]] = true;
                }
            }
        }
    }
}

int main() {
    fastcin;
    int N;
    cin >> N;
    int a1, a2; 
    a1 = a2 = N/2;
    if(a1+a2 != N) a1++;
    cout << a1 << " " << a2 << endl;
    return 0;
}