#408 Divizorii Oglinditului

#include <iostream>
using namespace std;
int main ()
{
    long long ogl = 0, n, d, cif, r = 0;
    cin >> n;
    while (n > 0)
    {
        cif = n % 10;
        n = n / 10;
        ogl = ogl * 10 + cif;
    }
    for (d = 1; d <= ogl; d++)
    {
        if (ogl % d == n)
            r++;
    }
    cout << r;
    return 0;
}