#include <bits/stdc++.h>
using namespace std;
const int N = 2105;
const int mod = 1e9 + 7;
long long f(long long cur) { return 3 * (cur * (cur + 1)); }
int main() {
  long long n;
  cin >> n;
  long long step = 0;
  long long deg = 31;
  while (deg-- > 0) {
    if (f(step + (1 << deg)) <= n) step += (1 << deg);
  }
  n -= f(step);
  step++;
  long long x = 2 * (step - 1);
  long long y = 0;
  if (n == 0) {
    cout << x << " " << y << endl;
    return 0;
  }
  if (n == 1) {
    cout << x + 1 << " " << y + 2 << endl;
    return 0;
  }
  x += 1;
  y += 2;
  n--;
  if (n < step - 1) {
    cout << x - n << " " << y + 2 * n << endl;
    return 0;
  }
  x -= step - 1;
  y += 2 * (step - 1);
  n -= step - 1;
  if (n < step) {
    cout << x - 2 * n << " " << y << endl;
    return 0;
  }
  x -= 2 * step;
  y += 0;
  n -= step;
  if (n < step) {
    cout << x - n << " " << y - 2 * n << endl;
    return 0;
  }
  x -= step;
  y -= 2 * step;
  n -= step;
  if (n < step) {
    cout << x + n << " " << y - 2 * n << endl;
    return 0;
  }
  x += step;
  y -= 2 * step;
  n -= step;
  if (n < step) {
    cout << x + 2 * n << " " << y << endl;
    return 0;
  }
  x += 2 * step;
  y += 0;
  n -= step;
  if (n < step) {
    cout << x + n << " " << y + 2 * n << endl;
    return 0;
  }
  x += step;
  y += 2 * step;
  n -= step;
  return 0;
}
