#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

int main()
{
    const int n = 6;
    const int maxScore = (n - 2) * 100;

    vector<vector<vector<long long> > > dp(n, vector<vector<long long> >(101, vector<long long>(maxScore + 1, 0)));
    dp[0][0][0] = 1;
    for(int i=1; i<=n; ++i)
        dp[0][0][0] *= i;

    for(int i=0; i<n; ++i){
        vector<vector<vector<long long> > > nextDp(n, vector<vector<long long> >(101, vector<long long>(maxScore + 1, 0)));
        for(int a=0; a<n; ++a){
            for(int b=0; b<=100; ++b){
                for(int c=0; c<=maxScore; ++c){
                    if(dp[a][b][c] == 0)
                        continue;

                    for(int b2=b; b2<=100; ++b2){
                        int c2 = c;
                        if(0 < i && i < n - 1)
                            c2 += b2;

                        if(i > 0 && b == b2)
                            nextDp[a+1][b2][c2] += dp[a][b][c] / (a + 2);
                        else
                            nextDp[0][b2][c2] += dp[a][b][c];
                    }
                }
            }
        }
        dp.swap(nextDp);
    }

    int x1, x2;
    char c;
    cin >> x1 >> c >> x2;
    int sum = (x1 * 100 + x2) * (n - 2) / 100;

    long long ans = 0;
    for(int a=0; a<n; ++a){
        for(int b=0; b<=100; ++b){
            ans += dp[a][b][sum];
        }
    }
    cout << ans << endl;

    return 0;
}