Untitled

#include <bits/stdc++.h>
using namespace std;
void prime_factors(long long n, vector<long long>& p) 
{
    for (long long i = 2; i * i <= n; i++) 
    {
        if (n % i == 0) 
        {
            while (n % i == 0) 
            {
                p.push_back(i);
                n /= i;
            }
        }
    }
    if (n > 1) 
    {
        p.push_back(n);
    }
    for (int i = 0; i < p.size(); i++) 
    {
        cout << p[i];
        if (i != p.size() - 1) 
        {
            cout << " x ";
        }
    }
    cout << endl;
}
int main() {
    while (1) 
{
        long long n;
        cin >> n;
        if (n == 0) break;
        cout << n << " = ";
        vector<long long> p;

        if (n < 0) {
            cout << "-1 x ";
            n *= -1;
        }
        prime_factors(n, p);
    }
    return 0;
}