for i in range(int(input())):
k = int(input())
s = input().lstrip('P').split('A')
print(len(max(s)))#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <deque>
#include <map>
#include <cmath>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <iomanip>
using namespace std;
#define int long long
#define gcd __gcd
#define INT_MAX INT64_MAX
#define INT_MIN INT64_MIN
#define hi cerr<<"HI"<<endl;
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#define yeah cout<<"YES\n";
#define nope cout<<"NO\n";
void solve(){
int n; cin>>n;
string s; cin>>s;
int ans = 0;
int cnt = 0;
// int n = s.length();
for(int i = n-1; i>=0; i--){
if(s[i] == 'P'){cnt++;}
if(s[i] == 'A'){ans = max(ans, cnt); cnt = 0;}
}
cout<<ans<<endl;
}
int32_t main(){
int t; cin>>t; while(t--)
solve();
return 0;
}232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |