import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write A,B,C,D=map(int,readline().split()) G=GCD(A,B) if GCD(C,D)!=G: print(-1) exit() x,y=A,B ans_lst=[] if x<0 and y<0: ans_lst.append((1,1)) x+=y ans_lst.append((2,-1)) y-=x if x<0 and y>=0: ans_lst.append((2,-1)) y-=x ans_lst.append((1,1)) x+=y elif x>=0 and y<0: ans_lst.append((1,-1)) x-=y ans_lst.append((2,1)) y+=x while x and y: if x>y: ans_lst.append((1,-(x//y))) x%=y else: ans_lst.append((2,-(x//y))) y%=x if x==0: ans_lst.append((1,1)) ans_lst.append((2,-1)) stack=[] x,y=C,D if x<0 and y<0: stack.append((1,-1)) x+=y stack.append((2,1)) y-=x if x<0 and y>=0: stack.append((2,1)) y-=x stack.append((1,-1)) x+=y elif x>=0 and y<0: stack.append((1,1)) x-=y stack.append((2,-1)) y+=x while x and y: if x>y: stack.append((1,x//y)) x%=y else: stack.append((2,x//y)) y%=x ans_lst+=stack[::-1] print(len(ans_lst)) for q,k in ans_lst: print(q,k)