import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int divCnt;
        int maxDivCnt = 0;
        int maxN = 1;

        for (int i = 1; i <= N; i++) {

            divCnt = divCnt(i);
            if(maxDivCnt < divCnt) {
                maxDivCnt = divCnt;
                maxN = i;
            }
        }
        System.out.println(maxN);
    }

    private static int divCnt(int i) {
        int cnt = 0;
        return divCnt(i, cnt);
    }

    private static int divCnt(int i,int cnt) {
        if(i/2 >= 1 && i%2 == 0) {
            i = i /2;
            cnt = divCnt(i,cnt);
            cnt ++;
        }
        return cnt;
    }

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz