#include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;

using i64 = long long;

i64 A, B, x, y;
vector<pair<i64, i64>> s;
set<pair<i64, i64>> E;

int main() {
    cin >> A >> B >> x >> y;

    s.push_back({0, 0});
    s.push_back({A, 0});
    s.push_back({0, B});
    s.push_back({A, B});
    E = set(s.begin(), s.end());

    // Check
    if (E.contains({x, y})) {
        cout << 0 << "\n";
        return 0;
    }
    if (A == 0 && B == 0 && (x != 0 || y != 0)) {
        cout << -1 << '\n';
        return 0;
    }
    {
        i64 d1, c1, d2, c2;
        for (d1 = 0, c1 = -1; A && (1ll << d1) <= A; d1++) {
            if ((1ll << d1) * x % A == 0) {
                c1 = (1ll << d1) * x / A;
                break;
            }
        }
        for (d2 = 0, c2 = -1; B && (1ll << d2) <= B; d2++) {
            if ((1ll << d2) * y % B == 0) {
                c2 = (1ll << d2) * y / B;
                break;
            }
        }
        if (c1 == -1 && c2 == -1) {
            cout << -1 << '\n';
            return 0;
        }
    }

    using P = pair<i64, i64>;

    auto dist = [&](P &a, P &b) {
        return (a.first - b.first) * (a.first - b.first) +
               (a.second - b.second) * (a.second - b.second);
    };
    int dep  = 0;
    auto dfs = [&](auto f, P x) -> void {
        sort(s.begin(), s.end(), [&](P &a, P &b) {
            return dist(a, x) < dist(b, x);
        });
        auto C = s[0];
        P D    = {x.first * 2 - C.first, x.second * 2 - C.second};

        dep++;
        if (!E.contains(D)) f(f, D);
        else cout << dep << "\n";

        if (dep)
            cout << D.first << " " << D.second << " " << C.first << " "
                 << C.second << '\n';
    };

    dfs(dfs, {x, y});
}