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

#define el '\n'
#define FIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> pt;
typedef unsigned long long ull;

template<typename T, typename X>
using hashTable = gp_hash_table<T, X>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

// mt19937_64 for long long
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());

vector<pair<int, ll>> ans;

void solve(ll a, ll b, bool f)
{
    if(!b)
        return;

    if(abs(a) < abs(b))
    {
        solve(b, a, !f);
        return;
    }

    ll k = a / b;
    if(abs(a - (k + 1) * b) < abs(a - k * b))
        k++;
    if(abs(a - (k - 1) * b) < abs(a - k * b))
        k--;

    ans.emplace_back(f, k);
    solve(a - k * b, b, f);
}

void doWork()
{
    ll a, b;
    cin >> a >> b;
    solve(a, b, 0);
    cout << ans.size() << '\n';
    for(auto &[op, k]: ans)
        cout << op + 1 << ' ' << -k << '\n';
}

signed main()
{
    FIO
    int T = 1;
//    cin >> T;
    for(int i = 1; i <= T; i++)
        doWork();
}