unsigned int factori(unsigned int n, unsigned int m)
{
    unsigned int apN[10000];
    unsigned int apM[10000];

    int div = 2;
    int exp = 0;
    while(n > 1)
    {
        while(n % div == 0)
        {
            n = n / div;
            exp++;
        }
        if(exp != 0)
            apN[div]++;
        div++;
        exp = 0;
    }

    div = 2;
    exp = 0;
    while(m > 1)
    {
        while(m % div == 0)
        {
            m = m / div;
            exp++;
        }
        if(exp != 0)
            apM[div]++;
        div++;
        exp = 0;
    }
    int result = 0;
    for(int i = 2; i <= 10000; i++)
        if(apN[i] != 0 && apM[i] != 0)
            result++;
    return result;
}