UVaLive 7270 Osu! Master (统计)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
using namespace std ;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 3e5 + 5;
const int mod = 1e9 + 7;
const int dr[] = {0, 0, -1, 1};
const int dc[] = {-1, 1, 0, 0};
int n, m;
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}
char s[10];

int main(){
    int n;
    while(cin >> n){
        int ans = 0;
        for(int i = 0; i < n; ++i){
            cin >> s;
            if(s[0] == 'S') ++ans;
            else{
                cin >> m;
                if(1 == m)  ++ans;
            }
        }
        cout << ans << endl;
    }
    return 0;
}