//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);}
void solve(int H,int W,int x,int y)
{
	if((x==H||!x)&&(y==W||!y)) return ;
	if(x==H||!x)
	{
		if(y<=W/2)
		{
			solve(H,W,x,y*2);
			cout<<x<<" "<<0<<" "<<x<<" "<<y*2<<'\n';
		}
		else
		{
			solve(H,W,x,y*2-W);
			cout<<x<<" "<<W<<" "<<x<<" "<<y*2-W<<'\n';
		}
		return ;
	}
	if(y==W||!y)
	{
		if(x<=H/2)
		{
			solve(H,W,x*2,y);
			cout<<0<<" "<<y<<" "<<x*2<<" "<<y<<'\n';
		}
		else
		{
			solve(H,W,x*2-H,y);
			cout<<H<<" "<<y<<" "<<x*2-H<<" "<<y<<'\n';
		}
		return ;
	}
	if(x<=H/2&&y<=W/2)
	{
		solve(H,W,x*2,y*2);
		cout<<0<<" "<<0<<" "<<x*2<<" "<<y*2<<'\n';
	}
	else if(x<=H/2)
	{
		solve(H,W,x*2,y*2-W);
		cout<<0<<" "<<W<<" "<<x*2<<" "<<y*2-W<<'\n';
	}
	else if(y<=W/2)
	{
		solve(H,W,x*2-H,y*2);
		cout<<H<<" "<<0<<" "<<x*2-H<<" "<<y*2<<'\n';
	}
	else
	{
		solve(H,W,x*2-H,y*2-W);
		cout<<H<<" "<<W<<" "<<x*2-H<<" "<<y*2-W<<'\n';
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int A,B,C,D;
	cin>>A>>B>>C>>D;
	int rA=A;
	int rB=B;
	int rC=C;
	int rD=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");
	cout<<max(__lg(A),__lg(B))<<'\n';
	solve(rA,rB,rC,rD);
	return 0;
}