#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        
        string a, b, c;
        cin >> a >> b >> c;
        int x = (a.size()+1)/2;
        int y= (b.size() + 1) / 2;
        int z= (c.size() + 1) / 2;
        
        if (a == "NONE")x = 0;
        if (b == "NONE")y = 0;
        if (c == "NONE")z = 0;
        ll p = 1;

        x = 16 - x; y = 16 - y; z = 16 - z;
        cout << x * x * y * y * z * z;
       
        /*
        ll n;
        cin >> n;
        ll i = 1;
        while (i * i * i < n)i++;
        cout << i;
        */
    }
        return 0;
    }