from sortedcontainers import SortedSet,SortedList
from collections import defaultdict
import heapq
from bisect import bisect_right
from itertools import groupby
N = int(input())
S=list(input())
ans=[]
for i in range(N-1):
    if S[i]=="x" and S[i+1]=="o":
        ans.append(i+1)
print(*ans)