1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
int T,M,N,K,I,a,b,c,cnt;
char ch;
int arr[5005];
pii ans;    // {times, K}

void init(){
  cin >> N;
  for(int i=0;i<N;i++){
    cin >> ch;
    arr[i] = (ch == 'B'); // need to be reversed
  }
}
int flip[5005], k;
inline bool get_dir(int &v){
  if(v-k<0) return (flip[v-1]&1)^arr[v];
  return ((flip[v-1]-flip[v-k])&1)^arr[v];
}
pii cal(){
  memset(flip, 0, sizeof(flip));
  int times = flip[0] = arr[0];
  for(int i=1;i+k-1<N;i++){
    flip[i] = flip[i-1];
    if(get_dir(i))
      ++times, ++flip[i];
  }
  // check if wrong direction
  for(int i=N-k+1;i<N;i++){
    flip[i] = flip[i-1];
    if(get_dir(i))  
      return make_pair(INT_MAX, 1);
  }
  return make_pair(times, k);
}
void sol(){
  k = 1;
  ans = cal();
  for(int i=2;i<=N;i++){  // K
    k = i;
    ans = min(ans, cal());
  }
  cout << ans.Y << " " << ans.X << endl;
}
int main(){
  ios::sync_with_stdio(false);cin.tie(0);
  init();
  sol();
}