#include <bits/stdc++.h>
using namespace std;
const int inf = 2e8 + 5;
const long long l_inf = 9e18 + 5;
template <typename T, typename T2>
ostream &operator<<(ostream &s, const pair<T, T2> &p) {
  return s << p.first << ' ' << p.second << ' ';
}
template <typename T, typename T2>
istream &operator>>(istream &s, pair<T, T2> &p) {
  return s >> p.first >> p.second;
}
template <typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
  for (auto it : v) s << it << ' ';
  return s;
}
template <typename T>
istream &operator>>(istream &s, vector<T> &v) {
  for (auto it = (v).begin(), it_ = (v).end(); it != it_; it++) s >> *it;
  return s;
}
template <typename T>
void read_range(T beg, T end) {
  while (beg != end) cin >> *beg++;
}
template <typename T>
void print_range(T beg, T end) {
  while (beg != end) cout << *beg++ << ' ';
}
struct reader {
  template <typename T>
  reader &operator,(T &v) {
    cin >> v;
    return *this;
  }
} rdr;
struct debugger {
  template <typename T>
  debugger &operator,(const T &v) {
    cerr << v << ", ";
    return *this;
  }
} dbg;
unordered_map<int, int> f[2];
void factors(long long n, int i) {
  long long z = 2;
  while (z * z <= n)
    if (n % z == 0) {
      f[i][z]++;
      n /= z;
    } else
      z++;
  if (n > 1) f[i][n]++;
}
long long a[3], b[3];
int main() {
  ios_base::sync_with_stdio(false);
  rdr, a[1], b[1], a[2], b[2];
  factors(a[1], 0);
  factors(b[1], 0);
  factors(a[2], 1);
  factors(b[2], 1);
  int two[3], three[3];
  two[1] = f[0][2], two[2] = f[1][2];
  three[1] = f[0][3], three[2] = f[1][3];
  int max_three;
  if (three[1] > three[2])
    max_three = 1;
  else if (three[1] < three[2])
    max_three = 2;
  else
    max_three = -1;
  long long r = 0;
  if (max_three != -1) {
    r += three[max_three] - three[3 - max_three];
    for (int i = 0; i < r; i++)
      if (a[max_three] % 3 == 0)
        a[max_three] /= 3, a[max_three] *= 2;
      else
        b[max_three] /= 3, b[max_three] *= 2;
    two[max_three] += r;
  }
  int max_two;
  if (two[1] > two[2])
    max_two = 1;
  else if (two[1] < two[2])
    max_two = 2;
  else
    max_two = -1;
  int r_two = 0;
  if (max_two != -1) {
    r_two += two[max_two] - two[3 - max_two];
    for (int i = 0; i < r_two; i++)
      if (a[max_two] % 2 == 0)
        a[max_two] /= 2;
      else
        b[max_two] /= 2;
  }
  if (a[1] * b[1] == a[2] * b[2]) {
    cout << r + r_two << '\n';
    cout << a[1] << ' ' << b[1] << '\n' << a[2] << ' ' << b[2];
  } else
    cout << -1;
  return 0;
}
