https://pintia.cn/problem-sets/994805046380707840/problems/1111914599412858880

题解：思维

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
char str[N];
char s[100]="qiao ben zhong.";
struct node{};
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    scanf("%d",&t);
    getchar();
    while(t--){
    //scanf("%d",&n);
        cin.getline(str,10000,'\n');
        int len=strlen(str);
        flag=1;
        for(int i=0;i<len;i++){
            if(str[i]==','||str[i]=='.'){
                flag=(flag&&str[i-3]=='o'&&str[i-2]=='n'&&str[i-1]=='g');
            }
        }
        if(flag){
            cnt=3;
            for(int i=len-1;i>=0;i--){
                if(str[i]==' '){
                    cnt--;
                    if(cnt==0){
                        str[i+1]='\0';
                        cout<<str<<s<<endl;
                        break;
                    }
                }
            }
        }else{
            cout << "Skipped" << endl;
        }
    }

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}