// yukicoder: No.537 ユーザーID // 2019.4.19 bal4u #include #include // 数値のハッシュ関数 #define HASHSIZ 2000081 long long hash[HASHSIZ+5], *hashend = hash+HASHSIZ; int insert(long long n) { long long *p = hash + n % HASHSIZ; while (*p) { if (*p == n) return 0; if (++p == hashend) p = hash; } *p = n; return 1; } int reg(long long a, long long b) { int f = 0; long long k, aa, bb; aa = a, k = 1; while (aa) aa /= 10, k*= 10; f += insert(b*k+a); bb = b, k = 1; while (bb) bb /= 10, k *= 10; f += insert(a*k+b); return f; } int main() { int i, b, ans; long long N; scanf("%lld", &N); if (N == 1) { puts("1"); return 0; } ans = reg(1, N); b = (int)sqrt((double)N); for (i = 2; i <= b; i++) { if (N % i == 0) ans += reg(i, N/i); } printf("%d\n", ans); return 0; }