CF615E.Hexagons

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.

阿亚拉特正在寻找完美的代码。他决定从一个由正六边形无限铺满的平面开始他的搜索。为方便起见，引入了坐标系，请参看下图以了解六边形坐标的定义方式：

阿亚拉特正在该平面上搜索。他从点 $(0,\,0)$ 出发，并沿螺旋路径移动（见第二张图）。有时他会忘记自己当前所在的位置。请帮助阿亚拉特确定他在经过 $n$ 次移动后所处的位置。

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

输入仅包含一个整数 $n$（$0 ≤ n ≤ 10^{18}$）——表示 Ayrat 的移动次数。

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

输出两个整数 $x$ 和 $y$ —— Ayrat 当前的坐标。