n = int(input())
s = input()
SF = 0
FS = 0
for i in range(n - 1):
if s[i] + s[i + 1] == 'SF':
SF += 1
if s[i] + s[i + 1] == 'FS':
FS += 1
if SF > FS:
print('YES')
else:
print('NO')
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,t;
cin>>n;
string s1;
cin>>s1;
int count1=0,count2=0;
for(int i=0; i<n; i++)
{
if(s1[i] =='S' && s1[i+1] =='F'){
count1++;
}
if(s1[i] =='F' && s1[i+1] =='S'){
count2++;
}
}
if(count1 > count2){
cout<<"YES";
}
else{
cout<<"NO";
}
return 0;
}1566B - MIN-MEX Cut | 678C - Joty and Chocolate |
1352E - Special Elements | 1520E - Arranging The Sheep |
1157E - Minimum Array | 1661D - Progressions Covering |
262A - Roma and Lucky Numbers | 1634B - Fortune Telling |
1358A - Park Lighting | 253C - Text Editor |
365B - The Fibonacci Segment | 75A - Life Without Zeros |
1519A - Red and Blue Beans | 466A - Cheap Travel |
659E - New Reform | 1385B - Restore the Permutation by Merger |
706A - Beru-taxi | 686A - Free Ice Cream |
1358D - The Best Vacation | 1620B - Triangles on a Rectangle |
999C - Alphabetic Removals | 1634C - OKEA |
1368C - Even Picture | 1505F - Math |
1473A - Replacing Elements | 959A - Mahmoud and Ehab and the even-odd game |
78B - Easter Eggs | 1455B - Jumps |
1225C - p-binary | 1525D - Armchairs |