// compile: g++ -o data data.cpp -O3 -std=gnu++20 -Wall -Wextra -Wshadow -D_GLIBCXX_ASSERTIONS -ggdb3 -fmax-errors=2 -DLOCAL
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) {_variables(#x);_print(x);}
#else
#define debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTINF (int)(9223372036854775807)
#define int long long
#define MAXN 200010

// 26

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    int minv = INTINF;
    int ans = 0;
    rep(i, 0, n) {
        cin >> a[i];
        minv = min(minv, a[i]);
        while (a[i] && !(a[i] % 3)) a[i] /= 3, ++ans;
        while (a[i] && !(a[i] % 2)) a[i] /= 2, ++ans;
    }

    rep(i, 1, n) if (a[i] != a[i-1]) {
        cout << "-1" << endl;
        return 0;
    }
    debug(minv, a[0])
    for (; minv && (!(minv % 3) || !(minv % 2)); ) {
        // debug(minv % 3)
        while (minv && !(minv % 3)) minv /= 3, ans -= n;
        // debug(minv % 2)
        while (minv && !(minv % 2)) minv /= 2, ans -= n;
    }
    debug(minv)
    cout << ans << endl;

    return 0;
}