#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5;
string str;int n,a[M];
bool check(int mid){
	long long sum=0;int pos=0;
	while (pos<n){
		int res=a[pos],Min=a[pos];
		while (res<0&&pos+1<n)
			Min=min(Min,res+=a[++pos]);
		if (res<0) return sum+Min>=0;
		if (sum+Min<0) return 0;
		sum+=1ll*res*mid; pos++;
	} return 1;
}
void solve(){
	cin>>str;n=str.length();
	for (int i=0;i<n;i++) a[i]=str[i]=='V'?1:-1;
	if (str[0]=='P') return puts("-1"),void();
	int l=1,r=n,ans=0;
	while (l<=r){
		int mid=l+r>>1;
		if (check(mid)) ans=mid,r=mid-1;
		else l=mid+1;
	}
	printf("%d\n",ans);
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T;cin>>T;while (T--) solve(); return 0;
}