#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;

int
main()
{
  int n;
  cin >> n;

  vector<int> road;
  road.push_back(0);
  road.push_back(1);

  while (road.size() < n + 1) {
    int m = road.size();
    for (int i = 0; i < m; i++) {
      if (road.size() == n + 1) {
        break;
      }
      road.push_back(road[i] + 1);
    }
  }
  //ここまでbit数を数えるため配列作りのもの。
  //以下幅優先探索

  deque<vector <int> > ways;
  vector<int> way;
  vector<int> v(n + 1, 0);
  v[1] = 1;
  way.push_back(1);
  ways.push_back(way);

  while (ways.size() > 0) {
    way = ways.front();
    ways.pop_front();

    int l = way.back();
    if (l == n) {
      cout << v[l];
      return 0;
    }
    if (0 < l + road[l] && l + road[l] < n + 1 && v[l + road[l]] == 0) {
      vector<int> newWay;
      copy(way.begin(), way.end(), back_inserter(newWay));
      newWay.push_back(l + road[l]);
      ways.push_back(newWay);
      v[l + road[l]] = v[l] + 1;
    }
    if (0 < l - road[l] && l - road[l] < n + 1 && v[l - road[l]] == 0) {
      vector<int> newWay;
      copy(way.begin(), way.end(), back_inserter(newWay));
      newWay.push_back(l - road[l]);
      ways.push_back(newWay);
      v[l - road[l]] = v[l] + 1;
    }
  }
  cout << -1;
  return 0;
}