//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int A,B,C,D;
	cin>>A>>B>>C>>D;
	A=max(A,1);
	B=max(B,1);
	int g1=__gcd(A,C);
	A/=g1;
	C/=g1;
	int g2=__gcd(B,D);
	B/=g2;
	D/=g2;
	if(__builtin_popcount(A)>1) die("-1");
	if(__builtin_popcount(B)>1) die("-1");
	int x=0,y=0;
	cout<<max(__lg(A),__lg(B))<<'\n';
	while(A>B)
	{
		int val=A/2;
		cout<<x*g1<<" "<<y*g2<<" "<<(x+A)*g1<<" "<<y*g2<<'\n';
		if(val<=C)
		{
			C-=val;
			x+=val;
		}
		A/=2;
	}
	while(A<B)
	{
		int val=B/2;
		cout<<x*g1<<" "<<y*g2<<" "<<x*g1<<" "<<(y+B)*g2<<'\n';
		if(val<=D)
		{
			D-=val;
			y+=val;
		}
		B/=2;
	}
	while(A>1)
	{
		int val=A/2;
		cout<<x*g1<<" "<<y*g2<<" "<<(x+A)*g1<<" "<<(y+B)*g2<<'\n';
		if(val<=C)
		{
			C-=val;
			x+=val;
		}
		if(val<=D)
		{
			D-=val;
			y+=val;
		}
		A/=2;
		B/=2;
	}
	return 0;
}