#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 998244353; // constexpr int MOD = 1000000007; constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}; constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; constexpr int M = 1000000000; bool solve(ll a, ll b, vector>& x) { while (a != 0 && b != 0) { if (abs(a) > abs(b)) { const ll k = abs(a) / abs(b) * ((a > 0) == (b > 0) ? -1 : 1); a += k * b; x.emplace_back(1, k); } else { const ll k = abs(b) / abs(a) * ((a > 0) == (b > 0) ? -1 : 1); b += k * a; x.emplace_back(2, k); } assert(abs(a) <= M && abs(b) <= M); } if (a < 0) { b -= a; x.emplace_back(2, -1); a += b; x.emplace_back(1, 1); } else if (b < 0) { a -= b; x.emplace_back(1, -1); b += a; x.emplace_back(2, 1); } return b > 0; } int main() { int a, b, c, d; cin >> a >> b >> c >> d; if (a == 0 && b == 0) { cout << (c == 0 && d == 0 ? 0 : -1) << '\n'; return 0; } if (gcd(abs(a), abs(b)) != gcd(abs(c), abs(d))) { cout << "-1\n"; return 0; } vector> x, y; const bool f = solve(a, b, x), s = solve(c, d, y); reverse(ALL(y)); for (auto& [_, k] : y) k = -k; if (f != s) { if (f) { x.emplace_back(1, 1); x.emplace_back(2, -1); } else { x.emplace_back(2, 1); x.emplace_back(1, -1); } } copy(ALL(y), back_inserter(x)); assert(x.size() <= 1000); cout << x.size() << '\n'; for (const auto& [t, k] : x) { assert(abs(k) <= M); if (t == 1) { a += k * b; } else if (t == 2) { b += k * a; } cout << "x y = " << a << ' ' << b << '\n'; cout << t << ' ' << k << '\n'; } return 0; }