12289 - One-Two-Three solution

#include <cstring>
#include <cassert>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <climits>
#define scan(a) scanf("%d",&a);
#define s2(a,b) scanf("%d %d",&a,&b)
#define PI 2acos(-1.0)
#define s1(a) scanf("%d",&a);
#define INF 2<<15
#define PB(A) push_back(A)
#define clr(a,b) memset(a,b,sizeof(a))

using namespace std;

int main()
{
    int i,j,k;
    int n,t;
    string str;
    scanf("%d",&t);
    while(t--)
    {
        cin>>str;
        if(str.length()==5)
            printf("3\n");
        else
        {
            int cnt=0;
            if(str[0]=='o') cnt++;
            if(str[1]=='n') cnt++;
            if(str[2]=='e') cnt++;
            if(cnt>=2)
                printf("1\n");
            else
                printf("2\n");
        }
    }
return 0;
}