#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
int main(){
  int n;
  cin >> n;
  if(!(n & (n - 1))){
    cout << "1\n";
    return 0;
  }
  ll ans = 1e18;
  for(int i = 1; i < 63; i++){
    ll v = (1LL << i) - 1;
    if(v+1 < n) continue;
    if(v % n == 0){
      cout << "2\n";
      return 0;
    }
    v++;
    chmin(ans, v - (v/n*n+1) + 2);
    const ll t = n / (n & -n);
    chmin(ans, v - (v/t*t+1) + 3);
  }
  cout << ans << "\n";
}