```
import java.util.Scanner;

public class Main {

//计算最大公约数
static int gcd(int a, int b) {
    int temp;
    while (b != 0) {
        temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}
// 计算最小公倍数
static int lcm(int a, int b) {
    return (a*b)/(gcd(a, b));
}

//求快速幂
public static long power(long x, long n) {
    if (n == 0) {
        return 1;
    }
    long result = 1;
    while (n > 0) {
        if (n % 2 == 1) {
            result *= x;
        }
        x *= x;
        n /= 2;
    }
    return result;
}

//分解质因数
public static void main(String[] args) {
    Scanner in = new Scanner(System.in);
    int n = in.nextInt();
    int m = in.nextInt();
    int res=0;
    for (int i = 2; i <=n/i; i++) {
        if(n%i==0)
        {
            res++;
            while(n%i==0)
                n/=i;
        }
    }
    if(n>1) res++;
}

}```