import java.io.*;
import java.util.*;
import java.math.BigInteger;
public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);

   String nyuA=sc.nextLine();
  // String nyuB=sc.nextLine();
 
  //   String[] s=sc.nextLine().split(" ");
//     String[] e=sc.nextLine().split(" ");

int n=Integer.parseInt(nyuA);

//int N=Integer.parseInt(s[0]);
//int K=Integer.parseInt(s[1]);
int max=0;
int res=0;
for(int i=1;i<=n;i++){
int temp=i;
int count=0;
while(true){
if(temp%2!=0){


if(count>max){
max=count;
res=i;
//System.out.println(count+"--"+res);
}
break;
}//if
temp/=2;
count++;

}//while

}

if(res==0)res=1;

System.out.println(res);

//long H=Long.parseLong(t[0]);
//long W=Long.parseLong(t[1]);
//long C=Long.parseLong(t[2]);


	}
}
/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