#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    auto work = [&](int A, int X) -> vector<pair<int, int>> {
        if (A == X || X == 0) {
            return {};
        }
        int p = 1;
        while (A % 2 == 0) {
            p *= 2;
            A /= 2;
        }
        int f = A;
        if (X % f != 0) {
            return {{-1, -1}};
        }
        X /= f;
        A = p;
        vector<pair<int, int>> o;
        int l = 0, r = A;
        while (l != X && r != X) {
            int mid = l + r >> 1;
            o.push_back({l, r});
            if (mid == X) {
                break;
            } else if (mid > X) {
                r = mid;
            } else {
                l = mid;
            }
        }
        for (auto &[x, y]: o) {
            x *= f, y *= f;
        }
        return o;
    };

    int A, B, X, Y;
    cin >> A >> B >> X >> Y;

    auto a = work(A, X), b = work(B, Y);
    if (!a.empty() && a[0].first == -1 || !b.empty() && b[0].first == -1) {
        cout << "-1\n";
        return 0;
    }

    if (a.empty() || b.empty()) {
        int i = 0;
        cout << max(a.size(), b.size()) << '\n';
        while (i < a.size() || i < b.size()) {
            int x1 = X, y1 = Y, x2 = X, y2 = Y;
            if (i < a.size()) {
                x1 = a[i].first, x2 = a[i].second;
            }
            if (i < b.size()) {
                y1 = b[i].first, y2 = b[i].second;
            }
            i += 1;
            cout << x1 << " " << y1 << " " << x2 << " " << y2 << '\n';
        }
        return 0;
    }


    vector<array<int, 4>> answer;

    for(int rot = 0; rot < 2; ++rot) {
        {
            vector<array<int, 4>> pref;

            for (int i = 0; i < a.size(); ++i) {
                pref.push_back({a[i].first, 0, a[i].second, 0});
                pref.push_back({a[i].first, B, a[i].second, B});
            }
            int x = (a.back().first + a.back().second) / 2;
            for (int i = 0; i < b.size(); ++i) {
                pref.push_back({x, b[i].first, x, b[i].second});
            }
            if (answer.empty() || answer.size() > pref.size()) {
                answer = pref;
                if (rot) {
                    for(auto &t : answer) {
                        swap(t[0], t[1]);
                        swap(t[2], t[3]);
                    }
                }
            }
        }


        for (int it = 0; it < 2; ++it) {
            vector<array<int, 4>> ans;
            ans.push_back({a.back().first, b.back().first, a.back().second, b.back().second});
            int pos = 1;
            while (pos < a.size() && pos < b.size()) {
                int pa = (int) a.size() - pos - 1;
                int pb = (int) b.size() - pos - 1;
                if (a[pa].first == a[pa + 1].first) {
                    if (b[pb].first != b[pb + 1].first) break;
                } else {
                    assert(a[pa].second == a[pa + 1].second);
                    if (b[pb].second != b[pb + 1].second) break;
                }
                ans.push_back({a[pa].first, b[pb].first, a[pa].second, b[pb].second});
                pos++;
            }

            {
                vector<array<int, 4>> pref;
                bool ok1 = (b[0].first == ans.back()[1]);
                bool ok2 = (b[0].second == ans.back()[3]);
                for (int i = 0; i < a.size(); ++i) {
                    if ((a[i].first == ans.back()[0]) && (a[i].second == ans.back()[2] || ok2)) break;
                    pref.push_back({a[i].first, 0, a[i].second, 0});
                }
                for (int i = 0; i < a.size(); ++i) {
                    if ((a[i].first == ans.back()[0] || ok1) && (a[i].second == ans.back()[2])) break;
                    pref.push_back({a[i].first, B, a[i].second, B});
                }
                for (int i = 0; i < b.size(); ++i) {
                    if (b[i].first == ans.back()[1]) break;
                    pref.push_back({ans.back()[0], b[i].first, ans.back()[0], b[i].second});
                }
                for (int i = 0; i < b.size(); ++i) {
                    if (b[i].second == ans.back()[3]) break;
                    pref.push_back({ans.back()[2], b[i].first, ans.back()[2], b[i].second});
                }

                if (answer.empty() || answer.size() > pref.size() + ans.size()) {
                    answer = pref;
                    for (int t = (int) ans.size() - 1; t >= 0; --t) {
                        answer.push_back(ans[t]);
                    }
                    if (rot) {
                        for(auto &t : answer) {
                            swap(t[0], t[1]);
                            swap(t[2], t[3]);
                        }
                    }
                }
            }
            for (auto &[l, r]: a) swap(l, r);
        }
        swap(a, b);
        swap(A, B);
    }

    set<array<int, 2>> who;
    who.insert({0, 0});
    who.insert({A, 0});
    who.insert({A, B});
    who.insert({0, B});
    for(auto &t : answer) {
        array<int, 2> F = {t[0], t[1]};
        array<int, 2> S = {t[2], t[3]};
        assert((F[0] + S[0]) % 2 == 0);
        assert((F[1] + S[1]) % 2 == 0);
        assert(who.count(F) && who.count(S));
        auto MID = F;
        MID[0] = (F[0] + S[0]) / 2;
        MID[1] = (F[1] + S[1]) / 2;
        assert(!who.count(MID));
        who.insert(MID);
    }
    assert(who.count({X, Y}));

    cout << answer.size() << '\n';
    for(auto &t : answer) {
        for(auto &x : t) cout << x << ' ';
        cout << '\n';
    }

    return 0;
}