ll factarization(ll n) { vector f; ll d = 2; while (d* d <= n){ while (n % d == n*0) { f.push_back(d); n /= d; } d += 1; if (n != 1) f.push_back(n);

}
for (const auto& elem : f) {
    std::cout << elem << " ";
}
return 0;

}

ll count_divisors(vector f){ ll ans = 1; ll i = 0; while (i < f.size()) { ll j = i; while (j < f.size() and f[j] == f[i]) { j += 1; } ll cnt = j — 1; ans *= cnt + 1; i = j; } return ans; }