#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (int i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	auto f=[](ll a,ll b)->vector<pair<int,int>>{
		if(a==0&&b==0) return {};
		vector<pair<int,int>> ans;
		if(a==0){
			ans.push_back({1,1});
			a+=b;
		}
		if(b==0){
			ans.push_back({2,1});
			b+=a;
		}
		if(a<0){
			ll x=abs(a)/abs(b)+1;
			if(b<0) x*=-1;
			ans.push_back({1,x});
			a+=b*x;
		}
		if(b<0){
			ll x=abs(b)/abs(a)+1;
			ans.push_back({2,x});
			b+=a*x;
		}
		while(min(a,b)!=0){
			if(a>b){
				ll tmp=a/b;
				ans.push_back({1,-tmp});
				a-=tmp*b;
			}else{
				ll tmp=b/a;
				ans.push_back({2,-tmp});
				b-=tmp*a;
			}
		}
		if(a==0){
			ans.push_back({1,1});
			ans.push_back({2,-1});
		}
		return ans;
	};
	ll a,b,c,d;
	cin>>a>>b>>c>>d;
	if(__gcd(abs(a),abs(b))!=__gcd(abs(c),abs(d))){
		cout<<"-1\n";
		return ;
	}
	auto ans=f(a,b);
	auto tmp=f(c,d);
	reverse(all(tmp));
	for(auto x:tmp) ans.push_back({x.first,x.second*-1});
	for(auto x:ans){
		if(x.first==1){
			a+=b*x.second;
		}else{
			b+=a*x.second;
		}
		if(max(abs(a),abs(b))>1'000'000'000){
			bool Large=0;
			assert(Large);
		}
	}
	assert(a==c&&b==d);
	cout<<ans.size()<<endl;
	for(auto x:ans){
		cout<<x.first<<" "<<x.second<<"\n";
	}
}