import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } alias Op = Tuple!(int, "typ", long, "k"); alias Result = Tuple!(long, "g", Op[], "ops"); Result solve(long a, long b) { Op[] ops; for (; ; ) { if (a == 0) { // (0, b) ops ~= Op(1, 1); // (b, b) ops ~= Op(2, -1); // (b, 0) swap(a, b); break; } else { const k = b / a; b %= a; ops ~= Op(2, -k); } if (b == 0) { // (a, 0) break; } else { const k = a / b; a %= b; ops ~= Op(1, -k); } } // (a, 0) if (a < 0) { // (a, 0) ops ~= Op(2, 1); // (a, a) ops ~= Op(1, -2); // (-a, a) ops ~= Op(2, 1); // (-a, 0) a = -a; } return Result(a, ops); } void main() { try { for (; ; ) { const A = readLong; const B = readLong; const C = readLong; const D = readLong; debug { writefln("(A, B) = (%s, %s), (C, D) = (%s, %s)", A, B, C, D); } auto resAB = solve(A, B); auto resCD = solve(C, D); debug { writeln("resAB = ", resAB); writeln("resCD = ", resCD); } if (resAB.g == resCD.g) { writeln(resAB.ops.length + resCD.ops.length); foreach (ref op; resAB.ops) { writeln(op.typ, " ", op.k); } foreach_reverse (ref op; resCD.ops) { writeln(op.typ, " ", -op.k); } } else { writeln(-1); } } } catch (EOFException e) { } }