#include "bits/stdc++.h"
#define int long long
using namespace std;

vector<int>primes;

void solve() {
    int n; cin >> n;
    int c = n;
    map<int,int>cnt;
    for(auto p : primes) {
        while(c % p == 0) {
            cnt[p]++;
            c /= p;
        }
    }

    if(c != 1)
        cnt[c]++;

    int sum = 0;
    for(auto i : cnt)
        sum += i.first * i.second;
    
    if(sum <= 41) {
        int sisa = 41 - sum;
        vector<int>ans;
        while(sisa--)
            ans.push_back(1);
        for(auto i : cnt) {
            for(int j = 0; j < i.second; ++j)
                ans.push_back(i.first);
        }

        cout << ans.size() << " ";
        for(auto i : ans) cout << i << " ";
        cout << '\n';
    } else { 
        cout << -1 << '\n';
    }
}

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

    //freopen("sum_41_chapter_1_input.txt", "r", stdin);
    //freopen("sum_41_chapter_1_output.txt", "w", stdout);
    const int N = 1e6 + 5;
    vector<bool>vis(N + 1, 0);
    for(int i = 2; i <= N; ++i) {
        if(!vis[i]) {
            primes.emplace_back(i);
            for(int j = i + i; j <= N; j += i) {
                vis[j] = 1;
            }
        }
    }

    int tc; cin >> tc;
    for(int T = 1; T <= tc; ++T) {
        cout << "Case #" << T << ": ";
        solve();
    }
    
    return 0;
}