import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    int cnt = 0;
    public int modpow(int a, int n, int X) {					
    	int res = 1;
    	while(n > 0) {				
    		if((n & 1) == 1)			
    			res = res * a;	
    		out.println(" n = " + n + " res = " + res);
    		a = a * a;			
    		n = n >> 1;
//    		if(res >= X)	return res;
    	}				
    	return res;				
    }					
    public void solve() {
    	int N = Integer.parseInt(sc.next());
    	int X = 1;
    	int cnt = 0;
    	while(X < N){
    		cnt++;
    		X *= 2;
    	}
    	if(X == N)	out.println(cnt);
    	else 		out.println(cnt + X - N);
    }
}