import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		in.close();
		int max = 1;
		int max1 = 1;
		for (int i = n; i > 1; i-- ) {
			int n_i = calc(i);
			if (max1 <= n_i) { 
				max = i;
				max1 = n_i;
			}
		}
		System.out.println(max);
		
	}
	public static int calc(int n) {
		if (n % 2 == 0) return 1 + calc(n / 2);
		else return 0;
	}
}
/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