Your city is in the non-negative part of the coordinate axis. You stay at point \((0,\ 0)\). All other points contain trees.

You want to view all of your city. You are required to know how far you cannot see the city. You must answer the following question:

Where is the nearest square \(n \times n\) of points such that you cannot see any of the trees?

You cannot see a tree if and only if on the line between you and the tree there must be another tree. For example, the tree that is on point \((3,\ 2)\) is visible and \((2,\ 2)\) is not.

You must determine the closest point in this scenario.

Input format

The first and only line contains integer \(n\) denoting the desired square side length. (\(2 \le n \le 14\))

Output format

In a line, print two space-separated integers denoting the lower-left corner of the square and it contains at most \(100\) digits.

Scoring

The lower your point's Euclidean distance is with you, the more point you can get.