#include <iostream>
#include <set>
#include <cstring>
#include <vector>
using namespace std;
const int maxn = 1e5 + 10;
typedef long long ll;

vector<ll> prime_divisors(ll n) {
    vector<ll> res;
    ll i = 2;
    while(i * i <= n) {
        if(n % i == 0) {
            res.push_back(i);
            while(n % i == 0) {
                n /= i;
            }
        }
        i++;
    }
    if(n > 1) {
        res.push_back(n);
    }
    return res;
}
int main() {

    return 0;
}