from collections import defaultdict, deque
from itertools import permutations, combinations
from math import factorial, ceil, floor
from decimal import Decimal
import heapq

def iipt(): return int(input())
def map_str(): return input().split()
def map_int(): return map(int, input().split())
def lmap_int(): return list(map(int, input().split()))
def lmap_str(): return list(map(input().split()))
# mod = 10**9 + 7

def main():
    n = iipt()
    s = input()
    new_s = s[::-1]
    ans = deque([n])
    i = n - 1
    for e in new_s:
        if e == "R":
            ans.appendleft(i)
        else:
            ans.append(i)
        i -= 1
    print(*ans)



if __name__ == '__main__':
    main()