import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from math import gcd

def to10(a, b):
    tk = []
    while b:
        if a == 0:
            tk.append((1, 1))
            tk.append((2, -1))
            break
        if abs(a) > abs(b):
            k, a = divmod(a, b)
            if a < 0:
                a -= b
                k += 1
            tk.append((1, -k))
        else:
            k, b = divmod(b, a)
            if b < 0:
                b -= a
                k += 1
            tk.append((2, -k))
        # print(a,b)
    if a < 0:
        tk.append((2, 1))
        tk.append((1, -2))
        tk.append((2, 1))

    return tk

# a=-10
# b=9
# print(a%b)


a, b, c, d = LI()

if (a, b) == (c, d):
    print(0)
    exit()

if gcd(a, b) != gcd(c, d):
    print(-1)
    exit()

tk = to10(a, b)
rtk = to10(c, d)

tk += [(t, -k) for t, k in rtk[::-1]]
print(len(tk))
for t, k in tk: print(t, k)