#include <bits/stdc++.h>
using namespace std;
int dx[6] = {1, -1, -2, -1, 1, 2};
int dy[6] = {2, 2, 0, -2, -2, 0};
long long n, cur, x, y;
long long ring() {
  long long l = 0, r = 1e9 + 10;
  while (r - l > 1) {
    long long mid = (r + l) / 2;
    if (mid * (mid * 3 + 2) <= n)
      l = mid;
    else
      r = mid;
  }
  if (r * (r * 3 + 2) <= n) return r;
  return l;
}
int main() {
  cin >> n;
  long long r = ring(), cnt = r + 1;
  cur = r * (r * 3 + 2);
  x = r, y = -2 * r;
  int k = 0;
  while (cur < n) {
    if (k == 1) cnt--;
    long long d = min(cnt, n - cur);
    cur += d;
    x += dx[k] * d;
    y += dy[k] * d;
    if (k == 1) cnt++;
    k++;
  }
  cout << x << " " << y << endl;
}
