#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
using namespace std;

int main(void){
    long long n, cnt=0, betu=0, ans;
    cin >> n;
    for(int i=1;i<=sqrt(n);i++){
        if(n%i == 0){
            int j = n/i;
            if( i == sqrt(n)){
            	double aa = sqrt(n);
            	double bb = i;
            	if(aa != bb){
            		continue;
            	}
            }
            string s1 = to_string(i);
            string s2 = to_string(j);
            if( (s1+s2) == (s2+s1) ){
                betu++;
            }else{
                cnt++;
            }
        }    
    }
    cout << cnt*2+betu << endl;

    return 0;
}