import java.util.Scanner;

// 11
class Main{
	static int breakNumber(int n) {
		if (n % 2 == 0) {
			int tmp = n;
			int count = 0;
			while (tmp > 0) {
				if(tmp / 2 == 1) {
					++count;
					break;
				}
				tmp /= 2;
				++count;
			}
			return count;
		}
		
		return 0;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		
		int ans = 0;
		for(int i = 2; i <= N; i++)
			ans = Math.max(ans, breakNumber(i));
		
		System.out.println((int)Math.pow(2, ans));
	}

}

/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