#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s, t, u; cin >> s >> t >> u; int r = 16, g = 16, b = 16; if(s[0] != 'N')r -= s.size() / 2 + 1; if(t[0] != 'N')g -= t.size() / 2 + 1; if(u[0] != 'N')b -= u.size() / 2 + 1; int ans = r * r * g * g * b * b; cout << ans << endl; return 0; }