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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;

#ifndef LOCAL
#pragma GCC optimize("O3")
#endif

#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define endl '\n'
#define sp <<" "<<
#define eb emplace_back
#define MOD 1000000007
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

using ll = long long;
#define vec vector

template <class T> void print_v(vector<T> &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "}\n"; }
template <class T> void print_m(vector<vector<T>> &m) { for (auto v : m) print_v(v); cout << '\n'; }

#define fora(a) for(auto e:a)
#define it(i,s,e) for(long long int i=s;i<e;i++)
#define ita(i,s,e) for(long long int i=s;i<=e;i++)
#define itr(i,e,s) for(long long int i=e-1;i>=s;i--)
#define urs(r...)typename decay<decltype(r)>::type
#define rep(i,n)for(urs(n)i=0;i<(n);++i)


int lefts[300002];
int rights[300002];


void solve(int N, string line) {
    lefts[0] = 0;
    rights[0] = 0;
    lefts[N] = 0;
    rights[N] = 0;

    int total = 0;
    it (i,0,N) {
        total += line[i] == 'P'; 
        rights[i+1] = total;
    }

    total = 0;
    for (int i=N-1;i>=0;i--) {
        total += line[i] == 'L'; 
        lefts[i+1] = total;
    }

    for (int i=1; i<=N; i++) {
        cout << min(rights[i-1], lefts[i]) + min(rights[i], lefts[i+1]) << " ";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int chars;
    string line;
    cin >> chars >> line;

    solve(chars, line);

    return 0;
}