import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int max = 0;
		int nmax = 0;
		for (int i = 1; i <= n; i++) {
			int count = 0;
			boolean f = true;
			int a = i;
			while (f) {
				if (a%2==0) {
					count++;
					a = a/2;
					continue;
				}
				if (a%2==1) {
					if (max <= count) {
						max = count;
						nmax = i;
					}
					f = false;
				}
			}
		}
		System.out.println(nmax);
	}
}

/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