这题比较简单
#include<iostream>
#include<algorithm>
#include<list>
#include<cstdio>
#include<stack>
#include<string>
#include<cstring>
#define MAXN 200005
using namespace std;
char s[MAXN];
bool A[MAXN],AI[MAXN],F[MAXN];
int main(){
long n,x1=0,x2=0,x3=0;
scanf("%ld",&n);
char x;
scanf("%c",&x);
for(int i=0;i<n;i++){
scanf("%c",&x);
s[i] =x;
switch(x){
case 'A': x1++;break;
case 'F': x2++;break;
case 'I': x3++;
}
}
int i,j,k,len=n;
long ans=0;
for(i=0;i<len;i++){
if (s[i]=='A' && n-1==x2+x1-1)
ans++;
else if (s[i]=='I' && n-1==x2+x1) ans++;
}
cout<<ans;
return 0;
}