#include <iostream>
#include <stdio.h>
#include <cstring>
#include <math.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<b;i++)
using namespace std;

int main(){
	
	
	long long n;
	cin>>n;

	long long m=sqrt(double(n));
	long long c=0;
	int h[1000000];
	int k1,k2;
	int x1,x2;

	FOR(i,1,m+1){
		if(n%i==0){
			k1=int(log10(double(i)))+1;
			k2=int(log10(double(n/i)))+1;
			x1=i*pow(10,double(k2))+n/i;
			x2=n/i*pow(10,double(k1))+i;

			FOR(j,0,c){
				if(h[j]==x1){
					break;
				}
				if(j==c-1){
					c=c+1;
					h[c]=x1;
				}
			}
			FOR(j,0,c){
				if(h[j]==x2){
					break;
				}
				if(j==c-1){
					c=c+1;
					h[c]=x2;
				}
			}
		}
	}
	cout<<c<<endl;

	

	/*int k1,k2,x1,x2;
	int i,n;
	cin>>n>>i;

			k1=int(log10(double(i)))+1;
			k2=int(log10(double(n/i)))+1;
			x1=i*pow(10,double(k2))+n/i;
			x2=n/i*pow(10,double(k1))+i;

			cout<<k1<<endl<<k2<<endl<<x1<<endl<<x2;
			*/

	return 0;


}