#include<bits/stdc++.h>usingnamespace std;constint N =5e5+5;typedeflonglong LL;int n;char str[N];int l[N], r[N];intmain(){
cin >> n;
cin >> str;for(int i =0, h =0, g =0; i < n; i ++)if(str[i]=='G') l[i]= h, h =0, g ++;else l[i]= g, g =0, h ++;for(int i = n -1, h =0, g =0; i >=0; i --)if(str[i]=='G') r[i]= h, h =0, g ++;else r[i]= g, g =0, h ++;
LL res =0;for(int i =0; i < n; i ++)
res +=(LL)l[i]* r[i]+max(l[i]-1,0)+max(r[i]-1,0);
cout << res << endl;return0;}
#include<bits/stdc++.h>usingnamespace std;constint N =1e6+5;int n, k;intmain(){
cin >> n >> k;int res =0;for(int i =1; i <= n; i ++){int t = i;while(t){if(t %10== k) res ++;
t /=10;}}
cout << res << endl;return0;}
#include<bits/stdc++.h>usingnamespace std;constint N =1e5+5;int n, sum;int a[N];boolcheck(int cnt){int delta = sum / cnt;// 每一堆的和for(int i =0, s =0; i < n; i ++){
s += a[i];if(s > delta)returnfalse;if(s == delta) s =0;}returntrue;}intmain(){int T;
cin >> T;while(T --){
cin >> n;
sum =0;for(int i =0; i < n; i ++) cin >> a[i], sum += a[i];// 枚举最终分成的堆数for(int i = n; i; i --)if(sum % i ==0&&check(i)){
cout << n - i << endl;break;}}return0;}
#include<bits/stdc++.h>usingnamespace std;typedeflonglong LL;constint N =1e5+5;int n;int a[N];intmain(){
cin >> n;for(int i =0; i < n; i ++) cin >> a[i];sort(a, a + n);
LL ans =-1;int cost =-1;for(int i =0; i < n; i ++){int cost_now = a[i];
LL res =(LL)a[i]*(n - i);if(res > ans) ans = res, cost = cost_now;}
cout << ans <<' '<< cost << endl;return0;}