1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using PII = pair<int, int>;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<V<T>>;
template <typename T> using VVV = vector<VV<T>>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll INF = (1LL<<60);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m;
  cin >> n >> m;

  int ans = INF;

  int ret = 0;
  int n2 = n, n1 = 0, m2 = m, m1 = 0;
  while(1) {
    // uku
    int tmp = 0;
    // m1を減らす
    if(m1 > (n2+n1)) m1 -= n2+n1, tmp = n1+n2;
    else tmp = m1, m1 = 0;
    // m2を減らす (n2+n1) - tmp
    m2 -= (n2+n1-tmp)/2;
    // 余ってたらm1
    if(m2 <= 0 && m1 <= 0) break;
    if((n2+n1-tmp)%2 == 1) m2--, m1++; 
    ret++;
    // usi
    // n2->n1
    tmp = 0;
    if(n2 < m1+m2) tmp = n2, n1 += n2, n2 = 0;
    else n2 -= m1+m2, n1 += m1+m2, tmp = m1+m2;
    // n1を減らす (m1+m2) - tmp
    n1 -= m1+m2-tmp;
    if(n2 <= 0 && n1 <= 0) break;
    ret++;
  }
  chmin(ans, ret);

  swap(n, m);
  ret = 0;
  n2 = n, n1 = 0, m2 = m, m1 = 0;
  while(1) {
    // uku
    // n2->n1
    int tmp = 0;
    if(n2 < m1+m2) tmp = n2, n1 += n2, n2 = 0;
    else n2 -= m1+m2, n1 += m1+m2, tmp = m1+m2;
    // n1を減らす (m1+m2) - tmp
    n1 -= m1+m2-tmp;
    if(n2 <= 0 && n1 <= 0) break;
    ret++;
    // usi
    tmp = 0;
    // m1を減らす
    if(m1 > (n2+n1)) m1 -= n2+n1, tmp = n1+n2;
    else tmp = m1, m1 = 0;
    // m2を減らす (n2+n1) - tmp
    m2 -= (n2+n1-tmp)/2;
    // 余ってたらm1
    if(m2 <= 0 && m1 <= 0) break;
    if((n2+n1-tmp)%2 == 1) m2--, m1++; 
    ret++;
  }
  chmin(ans, ret);

  cout << ans << endl;
  return 0;
}