#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 5e5 + 7, P1 = 31, P2 = 37, mod = 1e9 + 7;
void fractionToDecimal(int numr, int denr)
{
    string res; // Initialize result

    // Create a map to store already
    // seen remainders, remainder is used
    // as key and its position in
    // result is stored as value.
    // Note that we need
    // position for cases like 1/6.
    // In this case,the recurring sequence
    // doesn't start from first
    // remainder.
    map<int, int> mp;
    mp.clear();

    // Find first remainder
    int rem = numr % denr;

    // Keep finding remainder until either remainder
    // becomes 0 or repeats
    int cnt =0;
    while ((rem != 0)
           && (mp.find(rem) == mp.end()))
    {
        // Store this remainder
        mp[rem] = res.length();

        // Multiply remainder with 10
        rem = rem * 10;

        // Append rem / denr to result
        int res_part = rem / denr;
        res += to_string(res_part);

        // Update remainder
        cnt++;
        rem = rem % denr;
    }
    if (rem == 0)
    {
        cout << cnt << " " << 0 << endl;
    }
    else
        cout << cnt-res.substr(mp[rem]).size() << " " << res.substr(mp[rem]).size() << endl;
}
void doWork() {
    int x,y;
    cin >> x >> y;
    vector<pair<int,int>> ans;
        
    while(x && y)
    {
        if(abs(x) > abs(y))
        {
            int cur = x / y;
            if(abs(x - (cur + 1) * y) < abs(x - cur * y))
                ++cur;
            if(abs(x - (cur - 1) * y) < abs(x - cur * y))
                --cur;
            x -= cur * y;
            ans.push_back({1,-cur});
        }
        else
        {
            swap(x,y);
            int cur = x / y;
            if(abs(x - (cur + 1) * y) < abs(x - cur * y))
                ++cur;
            if(abs(x - (cur - 1) * y) < abs(x - cur * y))
                --cur;
            x -= cur * y;
            swap(x,y);
            ans.push_back({2,-cur});
        }
    }
    cout << ans.size() << endl;
    for(auto it : ans)
        cout << it.first << " " << it.second << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
//    freopen("bisector.in","r",stdin);
//    freopen("bisector.out","w",stdout);
    int t = 1;
    // cout << primes.size() << endl;
    //cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}