Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Beautiful Divisors

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently Luba learned about a special kind of numbers that she calls beautiful numbers. The number is called beautiful iff its binary representation consists of *k* + 1 consecutive ones, and then *k* consecutive zeroes.

Some examples of beautiful numbers:

- 1
_{2}(1_{10}); - 110
_{2}(6_{10}); - 1111000
_{2}(120_{10}); - 111110000
_{2}(496_{10}).

More formally, the number is beautiful iff there exists some positive integer *k* such that the number is equal to (2^{k} - 1) * (2^{k - 1}).

Luba has got an integer number *n*, and she wants to find its greatest beautiful divisor. Help her to find it!

Input

The only line of input contains one number *n* (1 ≤ *n* ≤ 10^{5}) — the number Luba has got.

Output

Output one number — the greatest beautiful divisor of Luba's number. It is obvious that the answer always exists.

Examples

Input

3

Output

1

Input

992

Output

496

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2018 11:20:41 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|