#include <bits/stdc++.h>
using namespace std;
long long n;
int dx[6] = {-1, -2, -1, 1, 2, 1}, dy[6] = {2, 0, -2, -2, 0, 2};
int main() {
  cin >> n;
  if (n == 0) {
    cout << "0 0\n";
    return 0;
  }
  long long l = 0, r = 1000000000;
  while (l < r) {
    long long mid = (l + r + 1) >> 1;
    long long pp = mid * (mid + 1) * 3;
    if (pp >= n)
      r = mid - 1;
    else
      l = mid;
  }
  n -= l * (l + 1) * 3;
  long long sx = l * 2 + 2, sy = 0, qs = l + 1;
  for (int i = 0; i < 6; i++) {
    if (n < qs) {
      sx += dx[i] * n;
      sy += dy[i] * n;
      break;
    }
    n -= qs;
    sx += dx[i] * qs;
    sy += dy[i] * qs;
  }
  cout << sx << " " << sy << "\n";
}
