#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef pair p_ii; const int INF = 1e9; const double PI = acos(-1.0); const ll MOD = 1e9 + 7; int gcd(int a, int b){ if(a%b==0)return b; else return gcd(b,a%b); } int main() { int m,n; cin>>m>>n; int d = gcd(m,n); m/=d; n/=d;//m,nは互いに素 ll cost = 0LL; while(m!=n){ if(m<1||n<1)break; if(m>n)m-=n; else swap(m,n); cost++; } cout<