#include <bits/stdc++.h>
using namespace std;
int main() {
  long long index = 0;
  cin >> index;
  long long l = 0, r = 1e9, n = -1, mid, med;
  while (l <= r) {
    mid = (l + r) / 2;
    if (3 * mid * (mid + 1) <= index) {
      l = mid + 1;
      n = mid;
    } else
      r = mid - 1;
  }
  mid = 2 * n, med = 0;
  index -= 3 * n * (n + 1);
  if (index > 0) mid += 2;
  int dx[6] = {-1, -2, -1, 1, 2, 1}, dy[6] = {2, 0, -2, -2, 0, 2};
  for (int i = 0; i < 6; i++) {
    l = (index > n + 1) ? n + 1 : index;
    mid += dx[i] * l;
    med += dy[i] * l;
    index -= l;
  }
  cout << mid << " " << med;
  return 0;
}
