Beautiful Divisors

最新推荐文章于 2024-08-28 20:08:12 发布

原创最新推荐文章于 2024-08-28 20:08:12 发布 · 278 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种算法，用于找到给定整数的最大美丽除数。美丽数是一种特殊的数，其二进制形式包含k+1个连续的1后跟k个连续的0。文章通过示例展示了如何实现这一算法，并提供了完整的C语言代码。

Beautiful Divisors

CodeForces - 893B

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

Some examples of beautiful numbers:

1₂ (1₁₀);
110₂ (6₁₀);
1111000₂ (120₁₀);
111110000₂ (496₁₀).

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⁵) — 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.

Example

Input

Output

Input

Output

496#include <stdio.h>

int main()
{

    int n,i,x= 1,y = 1,b,sum;
    scanf("%d",&n);
    for(i = 1;i < 20;i++)
    {

        y = x;
        x *= 2;
        if(n % ((x - 1)*y) == 0)
        sum = (x - 1)*y;
        if(n < (x - 1)*y)
        break;
    }
    printf("%d\n",sum);
    return 0;
}