import java.util.*;
import java.util.TreeMap;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  }
} import java.util.*; util.* java import java.util.TreeMap; TreeMap java.util public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  } main {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int cnt = 0; cnt 0 int max = 0; max 0 int ans = 0; ans 0 if (N == 1) {
      System.out.println(1);
      return;
    } N == 1 N 1 {
      System.out.println(1);
      return;
    } System.out.println(1) System.out.println System.out System System.out 1 return; for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    } {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    } cnt = 0 cnt 0 int A = i; A i while (A % 2 == 0) {
        A /= 2;
        cnt++;
      } A % 2 == 0 A % 2 A 2 0 {
        A /= 2;
        cnt++;
      } A /= 2 A 2 cnt++ cnt if (cnt > max) {
        ans = i;
        max = cnt;
      } cnt > max cnt max {
        ans = i;
        max = cnt;
      } ans = i ans i max = cnt max cnt System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  }
} public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  }
} Main
import java.util.*;
import java.util.TreeMap;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int cnt = 0;
    int max = 0;
    int ans = 0;
    if (N == 1) {
      System.out.println(1);
      return;
    }
    for (int i = 1; i <= N; i++) {
      cnt = 0;
      int A = i;
      while (A % 2 == 0) {
        A /= 2;
        cnt++;
      }
      if (cnt > max) {
        ans = i;
        max = cnt;
      }
    }
    System.out.println(ans);
  }
}
