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
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef __int128 int128;
template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

struct FenwickPURQ {
    int size;
    VLL tab;

    FenwickPURQ(int n): size(n), tab(n + 1) {}
    void add(int i, LL x) {
        i++;
        while (i <= size) { tab[i] += x; i += LSB(i); }
    }
    LL get(int l, int r) { return get(r) - get(l - 1); }
    LL get(int r) {
        r++; LL sum = 0;
        while (r > 0) { sum += tab[r]; r -= LSB(r); }
        return sum;
    }
};

struct FenwickRUPQ {
    FenwickPURQ tree;

    FenwickRUPQ(int n): tree(FenwickPURQ(n)) {}
    void add_range(int l, int r, LL x) {
        tree.add(l, x);
        tree.add(r + 1, -x);
    }
    LL get(int r) { return tree.get(r); }
};

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n; cin >> n;
    string ants; cin >> ants;
    FenwickRUPQ fen(n);
    int i = 0;
    while (i < n && ants[i] == 'L') i++;
    int j = i + 1;
    while (i < n) {
        while (j < n && ants[j] == 'P') j++;
        if (j < n) {
            fen.add_range(i, i, 1);
            fen.add_range(j, j, 1);
            if (j - i > 1) fen.add_range(i + 1, j - 1, 2);
            i++; j++;
        } else i = j;
    }
    REP(i, n) cout << fen.get(i) << ' ';
    cout << '\n';

    return 0;
}