#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a,b,c; 
int ia,ib,ic;
vector< pair<int,int> > v;
inline void solve(){
	ll k=b/a,r=b%a;
	for(ll i=0; ;i++){
		if((k>>i)&1){
			v.push_back(make_pair(ib,ia));
			b-=a;
			a*=2;
		}
		else{
			v.push_back(make_pair(ic,ia));
			c-=a;
			a*=2;
		}
		if(b==r) break;
	}
} 
int main(){
	scanf("%lld%lld%lld",&a,&b,&c);
	ia=1,ib=2,ic=3;
	while(1){
		if(a>b) swap(a,b),swap(ia,ib);
		if(a>c) swap(a,c),swap(ia,ic);
		if(b>c) swap(b,c),swap(ib,ic); /*排序 */
		if(a==0) break;
		solve();
	} 
	printf("%d\n",(int)v.size());
	for(auto czc:v){
		printf("%d %d\n",czc.first,czc.second); 
	}
	return 0;
}