#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; //const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } long long gcd(long long a, long long b) { if (b == 0) return a; else return gcd(b, a%b); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int a, b, c, d; cin >> a >> b >> c >> d; int g0 = gcd(abs(a), abs(b)); int g1 = gcd(abs(c), abs(d)); if (g0 != g1) { cout << -1 << endl; return 0; } vector

v0, v1; auto f = [&](int &a, int &b, vector

&v)->void { if (a >= 0) return; v.emplace_back(1, 1); a += b; v.emplace_back(2, -1); b -= a; v.emplace_back(1, 1); a += b; // (a,b)->(b,-a) }; auto g = [&](int & a, int &b, vector

&v)->void { if (b >= 0) return; v.emplace_back(2, 1); b += a; v.emplace_back(1, -1); a -= b; v.emplace_back(2, 1); b += a; // (a,b)->(-b,a) }; auto h = [&](int & a, int &b, vector

&v)->void { // (a,b)->(0,g) or (0,g) while ((0 != a) && (0 != b)) { if (a >= b) { v.emplace_back(1, -(a / b)); a = a % b; } else { v.emplace_back(2, -(b / a)); b = b % a; } } if (0 != b) { v.emplace_back(1, 1); a += b; v.emplace_back(2, -1); b -= a; } // (a,b)->(g,0) }; if (a < 0)f(a, b, v0); if (a < 0)f(a, b, v0); if (b < 0)g(a, b, v0); h(a, b, v0); if (c < 0)f(c, d, v1); if (c < 0)f(c, d, v1); if (d < 0)g(c, d, v1); h(c, d, v1); reverse(all(v1)); cout << v0.size() + v1.size() << endl; rep(i, v0.size())cout << v0[i].first << " " << v0[i].second << endl; rep(i, v1.size())cout << v1[i].first << " " << -1 * v1[i].second << endl; return 0; }