#include <cmath>
#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using lint = long long;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)

int main() {
    lint N;
    cin >> N;

    int ng = -1, ok = 1e6;

    lint fng = 0;

    const double sqrt2 = sqrt(2.0);

    auto f = [&](int l) {
        lint ret = 0;
        REP(x, l + 1) {
            double u = l - sqrt2 * x;
            if (u >= 0) ret += u + 1;
            else {
                break;
            }
        }
        return ret;
    };

    while (ok - ng > 1) {
        const lint c = (ok + ng) / 2;
        if (auto fc = f(c); fc >= N) {
            ok = c;
        } else {
            fng = fc, ng = c;
        }
    }

    const lint req = N - fng;
    vector<tuple<double, int, int>> vs;
    REP(x, ok + 1) {
        int y = ok - sqrt2 * x;
        if (y < 0) break;
        if (auto t = x * sqrt2 + y; t > ok - 1) vs.emplace_back(t, x, y);
    }

    partial_sort(vs.begin(), vs.begin() + req, vs.end());

    auto ret = vs.at(req - 1);
    cout << get<2>(ret) << ' ' << get<1>(ret) << '\n';
}