"""

31063 96955 * (2**0.5) = 168178
2 * 10**6 位まで
二分探索も許されそうだな…

まず、1の位を決め打つか

候補を絞ってsortするのかなぁ

"""

import sys
from sys import stdin
import heapq

def cmp( a , b ):

    if a == b:
        return 0

    x = a[0] - b[0]
    y = a[1] - b[1]

    if x <= 0 and y <= 0:
        return -1
    elif x >= 0 and y >= 0:
        return 1

    if x < 0:
        if 2*(y**2) < x**2:
            return -1
        else:
            return 1
    else:
        if x**2 < 2*(y**2):
            return -1
        else:
            return 1

N = int(input())

L = 0
R = 168200

while R-L != 1:

    M = (L+R)//2
    now = 0

    for i in range(0,M+1):

        xfloat = ( (M-i)**2 / 2 ) ** 0.5

        x = None
        for xint in range(max(1,int(xfloat)-3) , int(xfloat) + 3):
            if 2 * (xint**2) > (M-i)**2:
                x = xint-1
                break

        now += x+1

    if now >= N:
        R = M
    else:
        L = M


rems = []

for i in range(0,R+1):
    
    xfloat = ( (R-i)**2 / 2 ) ** 0.5

    x = None
    for xint in range(max(1,int(xfloat)-3) , int(xfloat) + 3):
            if 2 * (xint**2) > (R-i)**2:
                x = xint-1
                break

    # 一番大きい奴が、R-1以上か? を見る

    maxa = i
    maxb = x
    rems.append( (maxa,maxb) )

    N -= x

from functools import cmp_to_key

ans = list(sorted(rems , key=cmp_to_key(cmp)))
#print (N,ans,R)

print (*ans[N-1])