#include<bits/stdc++.h>

using namespace std;
int id[5];
long long a[5];
vector<pair<int,int> >ans;
void add(int u,int v){
	a[u]-=a[v];
	a[v]+=a[v];
	ans.push_back({id[u],id[v]});
}
void Solve(){
	if(!(a[1]&&a[2]&&a[3]))return;
	if(a[1]>a[2])swap(a[1],a[2]),swap(id[1],id[2]);
	if(a[2]>a[3])swap(a[2],a[3]),swap(id[2],id[3]);
	if(a[1]>a[2])swap(a[1],a[2]),swap(id[1],id[2]);
	long long x=a[2]/a[1];
	if(a[2]%a[1]>a[1]-a[2]%a[1])x++;
	while(x){
		if(!(x&1))add(3,1);
		else if(a[2]>=a[1])add(2,1);
		else add(1,2);
		x>>=1;
	}
	Solve();
}
int main(){
	scanf("%lld%lld%lld",&a[1],&a[2],&a[3]);
	id[1]=1;id[2]=2;id[3]=3;
	Solve();
	printf("%d\n",(int)ans.size());
	for(auto [x,y]:ans)printf("%d %d\n",x,y);
	return 0;
}