#include #include int gcd(int a, int b) { if (a == 0) return b; else return gcd(b % a, a); } int main() { int a, b, c, d; scanf("%d %d %d %d", &a, &b, &c, &d); int g = gcd(abs(a), abs(b)); if (g != gcd(abs(c), abs(d))) { printf("-1\n"); fflush(stdout); return 0; } else if (g == 0) { printf("0\n"); fflush(stdout); return 0; } int k = 0, x, ans[1001][2]; if (a <= 0) { if (b == 0) { ans[k][0] = 2; ans[k++][1] = -1; b = -a; } if (b > 0) { x = abs(a) / b + 1; ans[k][0] = 1; ans[k++][1] = x; a += b * x; } else { x = abs(a) / abs(b) + 1; ans[k][0] = 1; ans[k++][1] = -x; a -= b * x; } } if (b <= 0) { if (a == 0) { ans[k][0] = 1; ans[k++][1] = -1; a = -b; } if (a > 0) { x = abs(b) / a + 1; ans[k][0] = 2; ans[k++][1] = x; b += a * x; } else { x = abs(b) / abs(a) + 1; ans[k][0] = 1; ans[k++][1] = -x; b -= a * x; } } while (a != g || b != g) { if (a > b) { x = a / b; if (a % b == 0) x--; ans[k][0] = 1; ans[k++][1] = -x; a -= b * x; } else { x = b / a; if (b % a == 0) x--; ans[k][0] = 2; ans[k++][1] = -x; b -= a * x; } } int kk = 0, anss[1001][2]; a = c; b = d; if (a <= 0) { if (b == 0) { anss[kk][0] = 2; anss[kk++][1] = 1; b = -a; } if (b > 0) { x = abs(a) / b + 1; anss[kk][0] = 1; anss[kk++][1] = -x; a += b * x; } else { x = abs(a) / abs(b) + 1; anss[kk][0] = 1; anss[kk++][1] = x; a -= b * x; } } if (b <= 0) { if (a == 0) { anss[kk][0] = 1; anss[kk++][1] = 1; a = -b; } if (a > 0) { x = abs(b) / a + 1; anss[kk][0] = 2; anss[kk++][1] = -x; b += a * x; } else { x = abs(b) / abs(a) + 1; anss[kk][0] = 1; anss[kk++][1] = x; b -= a * x; } } while (a != g || b != g) { if (a > b) { x = a / b; if (a % b == 0) x--; anss[kk][0] = 1; anss[kk++][1] = x; a -= b * x; } else { x = b / a; if (b % a == 0) x--; anss[kk][0] = 2; anss[kk++][1] = x; b -= a * x; } } int i; printf("%d\n", k + kk); for (i = 0; i < k; i++) printf("%d %d\n", ans[i][0], ans[i][1]); for (i = kk - 1; i >= 0; i--) printf("%d %d\n", anss[i][0], anss[i][1]); fflush(stdout); return 0; }