#include using namespace std; #define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i) #define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i) #define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--) #define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--) #define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i) #define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i) #define FOR(e, c) for (auto &e : c) #define SORT(v, n) sort(v, v + n); #define VSORT(v) sort(v.begin(), v.end()); #define RVISORT(v) sort(v.begin(), v.end(), greater()); #define ALL(v) v.begin(), v.end() using VI = vector; using VVI = vector; using PII = pair; using ll = long long; typedef long long ll; template void chmax(T& a, C b){ a>b?:a=b; } template void chmin(T& a, C b){ a>s1>>s2; string ans = "8/31"; if((s1=="Sat"||s1=="Sun")&&(s2=="Sat"||s2=="Sun"))ans="8/33"; else if(s1=="Sat"||s1=="Sun")ans="8/32"; cout << ans << endl; return 0; }