跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1420. Hexagons

    ID: 1426 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 7 上传者: 标签>二分模拟数学算法思想编程与模拟提高难度共享题库Codeforces英文题面题目来源题面语言

Hexagons

题目描述

E. Hexagons
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Ayrat is looking for the perfect code. He decided to start his search from an infinite field tiled by hexagons. For convenience the coordinate system is introduced, take a look at the picture to see how the coordinates of hexagon are defined:

Ayrat is searching through the field. He started at point (0,0) and is moving along the spiral (see second picture). Sometimes he forgets where he is now. Help Ayrat determine his location after n moves.

Input

The only line of the input contains integer n (0≤n≤1018)− the number of Ayrat's moves.

Output

Print two integers x and y− current coordinates of Ayrat coordinates.

Examples
Input
3
Output
-2 0
Input
7
Output
3 2

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 925 题。保留原作者与原赛事署名。