import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class BitSugoroku {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();

		try {
			int result = 1;
			int first = 1;
			List<Integer> resultList = new ArrayList<>();
			resultList.add(first);
			List<Integer> lastNumlist = new ArrayList<>();
			int bitCount = changeBinary(first);
			result += first;
			while (result != n) {
				bitCount = changeBinary(result);
				if ((result + bitCount) > n) {// nを超えてしまってるとき
					if (lastNumlist.contains(result)) {
						break;
					}
					lastNumlist.add(result);
					result -= bitCount;
					resultList.add(result);
				} else if ((result + bitCount) <= n) {// nを超えないとき
					resultList.add(result);
					result += bitCount;
				}
			}
			if (result == n) {
				resultList.add(result);
				System.out.println(resultList.size());
			} else if (result != n) {
				System.out.println("-1");
			}

		} catch (Exception e) {
			// TODO: handle exception
		}
	}

	private static int changeBinary(int result) {
		String bit = Integer.toBinaryString(result);
		String[] bitArray = bit.split("");

		// 2進数の１の数を数える
		int bitCount = 0;
		for (String sss : bitArray) {
			if (sss.equals("1")) {
				bitCount++;
			}
		}
		return bitCount;

	}

}