#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long floor(long long x) {
	return (long long)floor(sqrt((long double)x)); // 切り捨てした平方根
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n; cin >> n;
	long long pk = 1;
	double sqrt2 = sqrt(2);
	while (true) {
		long long x = pk / sqrt2;
		//誤差調整
		while (x > 0 && (x*x * 2 >= pk * pk)) {
			x--;
		}
		while (x*x * 2 <= pk * pk) {
			x++;
		}
		if (n <= x) break;
		n -= x;
		pk++;
	}
	// [pk-1,pk)のn番目
	vector<pair<double, long long>>v;
	for (long long i = 0; i * i * 2 < pk * pk; ++i) {
		double d = sqrt(2) * i - floor(i * i * 2);
		v.push_back({ d,i });
	}
	sort(all(v));
	long long ans1 = (pk-1)-floor(v[n-1].second * v[n - 1].second  *  2);
	long long ans2 = v[n - 1].second;
	cout << ans1 << " " << ans2 << endl;
	return 0;
}