#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  ll n; cin >> n;
  double lb = 0, ub = 31063 + 96955 * numbers::sqrt2;
  REP(_, 80) {
    const double mid = midpoint(lb, ub);
    ll num = 0;
    for (int a = 0; a <= mid; ++a) {
      num += llround(floor((mid - a) / numbers::sqrt2)) + 1;
    }
    (num < n ? lb : ub) = mid;
  }
  int p = 0, q = 0;
  double diff = LINF;
  for (int a = 0; a < ub + EPS; ++a) {
    const int b = llround((ub - a) / numbers::sqrt2);
    if (chmin(diff, abs(a + b * numbers::sqrt2 - ub))) {
      p = a;
      q = b;
    }
  }
  cout << p << ' ' << q << '\n';
  return 0;
}