eolymp
bolt
Try our new interface for solving problems
Problems

Dima & module

Dima & module

Time limit 1 second
Memory limit 256 MiB

The boy loves Dima bit operations with numbers, because they are fast, and does not like the modulus operation, because it is slow. He knows that if an integer N - power of two, then x % N = x (N-1) for any positive integer x, where — bitwise AND, and % — aking the modulo. He wants to extend this to other N and now wants to know for what proportion of the numbers x (1x10^100·N!) this equality is true for the N.

Input data

In a single line - an integer N (2N10^18).

Output data

In a single line - the answer to the problem as an irreducible fraction p/q.

Examples

Input example #1
4
Output example #1
1/1
Author Egor Kulikov
Source Winter School Kharkov 2012