Problem: Polycarpus likes giving presents to Paraskevi. He has bought two chocolate bars, each of them has the shape of a segmented rectangle. The first bar is a1 × b1 segments large and the second one is a2 × b2 segments large.

Polycarpus wants to give Paraskevi one of the bars at the lunch break and eat the other one himself. Besides, he wants to show that Polycarpus's mind and Paraskevi's beauty are equally matched, so the two bars must have the same number of squares.

To make the bars have the same number of squares, Polycarpus eats a little piece of chocolate each minute. Each minute he does the following:

  * he either breaks one bar exactly in half (vertically or horizontally) and eats exactly a half of the bar, 
  * or he chips of exactly one third of a bar (vertically or horizontally) and eats exactly a third of the bar. 



In the first case he is left with a half, of the bar and in the second case he is left with two thirds of the bar.

Both variants aren't always possible, and sometimes Polycarpus cannot chip off a half nor a third. For example, if the bar is 16 × 23, then Polycarpus can chip off a half, but not a third. If the bar is 20 × 18, then Polycarpus can chip off both a half and a third. If the bar is 5 × 7, then Polycarpus cannot chip off a half nor a third.

What is the minimum number of minutes Polycarpus needs to make two bars consist of the same number of squares? Find not only the required minimum number of minutes, but also the possible sizes of the bars after the process.

Input

The first line of the input contains integers a1, b1 (1 ≤ a1, b1 ≤ 109) — the initial sizes of the first chocolate bar. The second line of the input contains integers a2, b2 (1 ≤ a2, b2 ≤ 109) — the initial sizes of the second bar.

You can use the data of type int64 (in Pascal), long long (in С++), long (in Java) to process large integers (exceeding 231 - 1).

Output

In the first line print m — the sought minimum number of minutes. In the second and third line print the possible sizes of the bars after they are leveled in m minutes. Print the sizes using the format identical to the input format. Print the sizes (the numbers in the printed pairs) in any order. The second line must correspond to the first bar and the third line must correspond to the second bar. If there are multiple solutions, print any of them.

If there is no solution, print a single line with integer -1.

Examples

Input

2 6
2 3


Output

1
1 6
2 3


Input

36 5
10 16


Output

3
16 5
5 16


Input

3 5
2 1


Output

-1

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.AbstractCollection;
import java.util.TreeMap;
import java.util.Map;
import java.util.Map.Entry;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.Comparator;
import java.util.LinkedList;
import java.io.InputStream;
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Alex
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }
    static class TaskD {
        void sort(int[] a) {
            if (a[0] > a[1]) {
                int tmp = a[0];
                a[0] = a[1];
                a[1] = tmp;
            }
        }
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int[] a = IOUtils.readIntArray(in, 2);
            int[] b = IOUtils.readIntArray(in, 2);
            sort(a);
            sort(b);
            TreeMap<int[], Integer> aTimes = getStates(a);
            TreeMap<int[], Integer> bTimes = getStates(b);
            TreeMap<Long, Pair<Integer, int[]>> aBest = process(aTimes);
            TreeMap<Long, Pair<Integer, int[]>> bBest = process(bTimes);
            int res = Integer.MAX_VALUE;
            int[] aRes = null, bRes = null;
            for (Map.Entry<Long, Pair<Integer, int[]>> aEntry : aBest.entrySet()) {
                if (bBest.containsKey(aEntry.getKey())) {
                    Pair<Integer, int[]> aValue = aEntry.getValue();
                    Pair<Integer, int[]> bValue = bBest.get(aEntry.getKey());
                    int time = aValue.first + bValue.first;
                    if (time < res) {
                        res = time;
                        aRes = aValue.second;
                        bRes = bValue.second;
                    }
                }
            }
            out.printLine(res == Integer.MAX_VALUE ? -1 : res);
            if (res != Integer.MAX_VALUE) {
                out.printLine(aRes);
                out.printLine(bRes);
            }
        }
        private TreeMap<Long, Pair<Integer, int[]>> process(TreeMap<int[], Integer> times) {
            TreeMap<Long, Pair<Integer, int[]>> res = new TreeMap<>();
            for (Map.Entry<int[], Integer> entry : times.entrySet()) {
                int[] k = entry.getKey();
                long area = (long) k[0] * k[1];
                if (!res.containsKey(area) || entry.getValue() < res.get(area).first) {
                    res.put(area, Pair.makePair(entry.getValue(), entry.getKey()));
                }
            }
            return res;
        }
        TreeMap<int[], Integer> getStates(int[] a) {
            TreeMap<int[], Integer> times = new TreeMap<>(new Comparator<int[]>() {
                public int compare(int[] f, int[] s) {
                    if (f[0] != s[0]) return Integer.compare(f[0], s[0]);
                    return Integer.compare(f[1], s[1]);
                }
            });
            LinkedList<State> ll = new LinkedList<>(Arrays.asList(new State(a.clone(), 0)));
            while (!ll.isEmpty()) {
                State state = ll.pollFirst();
                sort(state.arr);
                if (times.containsKey(state.arr)) continue;
                times.put(state.arr.clone(), state.time);
                for (int div : new int[] {2, 3})
                    for (int idx = 0; idx <= 1; idx++) {
                        if (state.arr[idx] % div == 0) {
                            int[] narr = state.arr.clone();
                            narr[idx] -= narr[idx] / div;
                            ll.addLast(new State(narr, state.time + 1));
                        }
                    }
            }
            return times;
        }
        class State {
            int[] arr;
            int time;
            public State(int[] arr, int time) {
                this.arr = arr;
                this.time = time;
            }
        }
    }
    static class IOUtils {
        public static int[] readIntArray(InputReader in, int size) {
            int[] array = new int[size];
            for (int i = 0; i < size; i++) {
                array[i] = in.readInt();
            }
            return array;
        }
    }
    static class OutputWriter {
        private final PrintWriter writer;
        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }
        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }
        public void print(int[] array) {
            for (int i = 0; i < array.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(array[i]);
            }
        }
        public void printLine(int[] array) {
            print(array);
            writer.println();
        }
        public void close() {
            writer.close();
        }
        public void printLine(int i) {
            writer.println(i);
        }
    }
    static class Pair<U, V> implements Comparable<Pair<U, V>> {
        public final U first;
        public final V second;
        public static <U, V> Pair<U, V> makePair(U first, V second) {
            return new Pair<U, V>(first, second);
        }
        private Pair(U first, V second) {
            this.first = first;
            this.second = second;
        }
        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null || getClass() != o.getClass()) {
                return false;
            }
            Pair pair = (Pair) o;
            return !(first != null ? !first.equals(pair.first) : pair.first != null) &&
                    !(second != null ? !second.equals(pair.second) : pair.second != null);
        }
        public int hashCode() {
            int result = first != null ? first.hashCode() : 0;
            result = 31 * result + (second != null ? second.hashCode() : 0);
            return result;
        }
        public String toString() {
            return "(" + first + "," + second + ")";
        }
        @SuppressWarnings ({"unchecked"})
        public int compareTo(Pair<U, V> o) {
            int value = ((Comparable<U>) first).compareTo(o.first);
            if (value != 0) {
                return value;
            }
            return ((Comparable<V>) second).compareTo(o.second);
        }
    }
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;
        public InputReader(InputStream stream) {
            this.stream = stream;
        }
        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }
        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }
        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }
        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}