找最高位不大于 $n$ 的即可

#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n;
    cin>>n;
    int x=1;
    while(x<<1 <=n)
        x<<=1;
    cout<<x<<endl;
}