#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using pii = pair<int, int>;
const int N = 1000010;
int a, b, x, y;
vector<pii> px, py;
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    cin >> a >> b >> x >> y;
    int suma = 0, sumb = 0;
    if(a != 0) {
        for(int i = 0; i <= 30; ++i)
            if(a % (1 << i) == 0 && x % (a >> i) == 0 && x / (a >> i) <= (1 << i))   {suma = i;  break;}
            else if(a % (1 << i))   {cout << -1;    return 0;}
    }
    if(b != 0) {
        for(int i = 0; i <= 30; ++i)
            if(b % (1 << i) == 0 && y % (b >> i) == 0 && y / (b >> i) <= (1 << i))   {sumb = i;  break;}
            else if(b % (1 << i))   {cout << -1;    return 0;}
    }
    cout << max(suma, sumb) << "\n";
    for(int i = max(suma, sumb); i > 0; --i) {
        int nx = (a >> i) > 0 ? (x / (a >> i) > (1 << (i - 1))) : 1, ny = (b >> i) > 0 ? (y / (b >> i) > (1 << (i - 1))) : 1;
        // cerr << i << " : " << nx << " " << ny << " " << x << " " << y << "\n";
        px.pb({nx ? a : 0, ny ? b : 0}), py.pb({2 * x - px.back().fi, 2 * y - px.back().se});
        x = py.back().fi, y = py.back().se;
    }
    for(int i = px.size() - 1; i >= 0; --i) 
        cout << px[i].fi << " " << px[i].se << " " << py[i].fi << " " << py[i].se << "\n";
    return 0;
}