using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var s = ReadLine();
        var bitmax = 1 << s.Length - 1;
        var ans = 0;
        for (var b = 0; b < bitmax; ++b)
        {
            var tmp = b;
            var sum = 0L;
            long sub = s[0] - '0';
            for (var i = 1; i < s.Length; ++i)
            {
                if (tmp % 2 == 1)
                {
                    sum += sub;
                    sub = 0;
                }
                sub = sub * 10 + s[i] - '0';
                tmp >>= 1;
            }
            sum += sub;
            if (IsPrime(sum)) ++ans;
        }
        WriteLine(ans);
    }
    static bool IsPrime(long n)
    {
        if (n == 1) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;
        long i = 3;
        while (i * i <= n)
        {
            if (n % i == 0) return false;
            i = i + 2;
        }
        return true;
    }
}