#include<bits/stdc++.h>
using namespace std;
long long n;
int fx[5] = {0,1,0,-1};
int fy[5] = {-1,0,1,0};
void dfs(int n,int &x,int &y)
{
	for(int i = 1;i <= n;i++)
	{
		int cnt = i%4;
		x = fx[cnt] * i + x;
		y = fy[cnt] * i + y;
	}
}
int main()
{
	scanf("%d",&n);
	int x,y;
	x = y = 0;
	if(n <= 1e8) dfs(n,x,y);
	else{
		if(n%4==0){
			long long p = n/2;
			printf("%d %d",-p,-p);
			return 0;
		}else{
			int p = n%4;//p的值为1，2，3
			if(p == 1) printf("%lld -%lld",n/2+1,n/2);
			if(p == 2) printf("%lld %lld",n/2,n/2+1);
			if(p == 3) printf("-%lld %lld",n/2+1,n/2+1);
			return 0;
		}
	}
	printf("%d %d",x,y);
	return 0;
}