#include<bits/stdc++.h>
#define int long long
#define up(i,x,y) for(int i=x,i##E=y;i<=i##E;i++)
#define pu(i,x,y) for(int i=x,i##E=y;i>=i##E;i--)
#define rd(x) scanf("%lld",&x)
#define opl(x) printf("%lld",x)
#define mc cerr<<"qwq\n"
#define edl puts("")
using namespace std;
int a[10];
vector<pair<int,int>>v;
void pour(int i,int j)
{
	assert(a[i]>=a[j]);
	a[i]-=a[j];
	a[j]*=2;
	v.push_back(make_pair(i,j));
}

void solve()
{
	int tim=1000000;
	while(tim--)
	{
		
		int p,q,r;
		if(a[1]<=a[2]&&a[1]<=a[3])p=1;
		else if(a[2]<=a[1]&&a[2]<=a[3])p=2;
		else if(a[3]<=a[1]&&a[3]<=a[2])p=3;
		
		if(p!=1&&a[1]>=a[2]&&a[1]>=a[3])r=1;
		if(p!=2&&a[2]>=a[1]&&a[2]>=a[3])r=2;
		if(p!=3&&a[3]>=a[1]&&a[3]>=a[2])r=3;
		
		q=6-p-r;
		
		//p=min
		//q=mid
		//r=max
		
		int qwq=(a[q]/a[p]);
		
//		mc;
		
		for(int i=0;i<=30;i++)
		{
			if(qwq/(1<<(i+1))==0)break;
			if(qwq&(1<<i))
			{
				pour(q,p);
			}
			else
			{
				pour(r,p);
			}
		}
		
//		cout<<a[1]<<" "<<a[2]<<" "<<a[3];edl;
		
		pour(q,p);
		
//		cout<<a[1]<<" "<<a[2]<<" "<<a[3];edl;
		
		
		if(min(a[1],min(a[2],a[3]))==0)return;
		
	}
}


signed main()
{
	
	
	
	cin>>a[1]>>a[2]>>a[3];
	
	
	solve();
	
	assert(v.size()<=1000);
	
	cout<<v.size();
	
	puts("");
	for(auto to:v)
	{
		cout<<to.first<<" "<<to.second;
		puts("");
	}
	
	
	
	return 0;
}