K. A Game with Dice
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

Consider a game where each player rolls two regular six-sided dice on each turn. The points that the player receives are calculated as follows: let the points shown on the dice be $$$x$$$ and $$$y$$$; if $$$x \ne y$$$, then the player receives $$$(x+y)$$$ points; otherwise, the player receives $$$4x$$$ points.

For example:

  • if the first die shows $$$3$$$ and the second die shows $$$5$$$, the player receives $$$8$$$ points;
  • if the first die shows $$$6$$$ and the second die shows $$$1$$$, the player receives $$$7$$$ points;
  • if both dice show $$$4$$$, the player receives $$$16$$$ points.

Monocarp has rolled two dice and claims that the amount of points he should receive is $$$n$$$. You have to check whether this is possible; i. e. find any combination of amounts of points shown on the two dice that results in exactly $$$n$$$ points, or report that it is impossible.

Input

The only line contains one integer $$$n$$$ ($$$1 \le n \le 36$$$).

Output

Print two integers $$$x$$$ and $$$y$$$ ($$$1 \le x, y \le 6$$$) — the amounts of points on the two dice that result in getting exactly $$$n$$$ points. If there are multiple answers, print any of them. If it is impossible to receive exactly $$$n$$$ points by rolling two dice according to the rules of the game, print 0 0 instead.

Examples
Input
8
Output
3 5
Input
7
Output
6 1
Input
16
Output
4 4
Input
2
Output
0 0