#include <bits/stdc++.h>
using namespace std;
long long n;
long long stx, sty;
int res;
int xx[] = {-1, -2, -1, 1, 2, 1};
int yy[] = {2, 0, -2, -2, 0, 2};
void Go() {
  for (int i = 0; i < 6; i++) {
    if (n <= res) {
      stx += 1LL * xx[i] * n;
      sty += 1LL * yy[i] * n;
      return;
    } else {
      stx += 1LL * xx[i] * res;
      sty += 1LL * yy[i] * res;
      n -= res;
    }
  }
}
int main() {
  int m, i, j;
  cin >> n;
  if (n == 0) {
    puts("0 0");
    return 0;
  }
  int L = 1, R = 1e9;
  while (L <= R) {
    int mid = L + R >> 1;
    if (n <= 1LL * mid * (mid + 1) * 3) {
      res = mid;
      R = mid - 1;
    } else
      L = mid + 1;
  }
  n -= 1LL * res * (res - 1) * 3;
  stx = 2 * res;
  sty = 0;
  Go();
  cout << stx << " " << sty << endl;
  return 0;
}
