#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 1e5 + 10;
const int INF = 2e9;
string s;
int n;
int dp[maxn];

int rec(int at) {
    if(at >= n) {
        return 1;
    }

    if(dp[at] != -1) {
        return dp[at];
    }

    int res = 0;

    if(s[at] != '0') {
        res += rec(at + 1);
    }

    if(s[at] != '0' and at + 1 < n) {
        int num = (s[at] - '0') * 10 + (s[at + 1] - '0');
        if(num <= 26) {
            res += rec(at + 2);
        }
    }

    dp[at] = res;
    return res;

}
int main() {
    ios::sync_with_stdio(false);
    memset(dp, -1, sizeof dp);
    cin >> s;

    n = (int) s.size();
    cout << rec(0) << endl;
    return 0;
}