def Go(curr, n):
    y = 0
    x = -curr
    if(n-curr-1>0):
        n -= curr + 1
        y -= curr + 1
    else:
        y -= n
        print(x, y, sep=' ')
        return
    if(n-2*curr-1>0):
        n -= 2 * curr + 1
        x += 2 * curr + 1
    else:
        x += n
        print(x, y, sep=' ')
        return
    if(n-2*curr-2>0):
        n -= 2 * curr + 2
        y += 2 * curr + 2
    else:
        y += n
        print(x, y, sep=' ')
        return
    if(n-2*curr-2>0):
        n -= 2 * curr + 2
        x -= 2 * curr + 1
    else:
        x -= n
        print(x, y, sep=' ')
        return
    y -= n
    print(-(curr + 1), y, sep=' ')
    return

n = int(input())
curr = 0

while(True):

    step = 7 * (curr + 1) + curr
    if(n-step<0):
        break
    else:
        n -= step
        curr += 1
Go(curr, n)