from fractions import Fraction

def ispowoftwo(n):
  return n&(n-1) == 0

def solve():
  maxa, maxb = (int(x) for x in input().split())
  wanta, wantb = (int(x) for x in input().split())
  afrac = Fraction(wanta, max(1, maxa))
  bfrac = Fraction(wantb, max(1, maxb))
  adenom = afrac.denominator
  bdenom = bfrac.denominator
  if not ispowoftwo(adenom) or not ispowoftwo(bdenom):
    print(-1)
    return
  can = set()
  can.add((Fraction(0, 1), Fraction(0, 1)))
  can.add((Fraction(0, 1), Fraction(1, 1)))
  can.add((Fraction(1, 1), Fraction(0, 1)))
  can.add((Fraction(1, 1), Fraction(1, 1)))
  q = [(afrac, bfrac)]
  ret = []
  while q:
    (a, b) = q.pop()
    if (a, b) in can:
      continue
    can.add((a, b))
    if a.denominator == 1:
      al = Fraction(a)
    else:
      al = Fraction(a.numerator // 2, a.denominator // 2)
    ar = 2 * a - al
    if b.denominator == 1:
      bl = Fraction(b)
    else:
      bl = Fraction(b.numerator // 2, b.denominator // 2)
    br = 2 * b - bl
    q.append((al, bl))
    q.append((ar, br))
    ret.append((al, bl, ar, br))
  ret.sort(key=lambda x: max(x[0].denominator, x[1].denominator, x[2].denominator, x[3].denominator))
  print(len(ret))
  for a, b, c, d in ret:
    print(int(a * maxa), int(b * maxb), int(c * maxa), int(d * maxb))
solve()