#include <bits/stdc++.h>
using namespace std;

typedef pair <int, int> pii;
typedef long long ll;

struct atom {
	ll x;
	int id;
	atom (ll a = 0, int b = 0) : x(a), id(b) {}
	bool operator < (const atom A) const {
		return x < A.x;
	}
	bool operator > (const atom A) const {
		return x > A.x;
	}
	bool operator == (const atom A) const {
		return x == A.x;
	}
};

vector <pii> ans;
atom a, b, c;

void gg() {
	if ((int)ans.size() > 1000) return;
	printf("%d\n", (int)ans.size());
	for (auto i : ans) printf("%d %d\n", i.first, i.second);
	exit(0);
}

void gao(atom &a, atom &b) {
	assert(a.x >= b.x);
	a.x -= b.x; b.x *= 2;
	ans.emplace_back(a.id, b.id);
	if (!a.x) gg();
}

void gaomod(atom &a, atom &b, atom &c) {
	ll k = b.x / a.x;
	for (int i = 0; k; i++) {
		if ((k >> i) & 1) {
			gao(b, a);
			k ^= (1 << i);
		} else {
			gao(c, a);
		}
	}
}

mt19937 rng(0);

void solve(atom a, atom b, atom c) {
	ans.clear();
	for (int i = 1; i <= 50; i++) {
		if (a > b) swap(a, b);
		if (a > c) swap(a, c);
		if (b > c) swap(b, c);
		int x = rng() % 3;
		if (x == 0) gao(b, a);
		if (x == 1) gao(c, a);
		if (x == 2) gao(c, b);
	}
	while ((int)ans.size() <= 1000) {
		if (a > b) swap(a, b);
		if (a > c) swap(a, c);
		if (b > c) swap(b, c);
		ll mn = 1e18; int id = 0;
		ll x = b.x, y = c.x;
		for (int i = 0; i <= 20; i++) {
			ll now = (x < y ? x % a.x : y % a.x);
			if (now < mn) {
				mn = now; id = i;
			}
			if (x <= y) y -= x, x *= 2;
			else x -= y, y *= 2;
		}
		for (int i = 1; i <= id; i++) {
			if (b.x <= c.x) gao(c, b);
			else gao(b, c);
		}
		if (b.x % a.x == mn) gaomod(a, b, c);
		else gaomod(a, c, b);
	}
}

int main() {
	cin >> a.x >> b.x >> c.x;
	a.id = 1; b.id = 2; c.id = 3;
	while (1) {
		solve(a, b, c);
	}
	return 0;
}