## Sandwich

View as PDF

Points: 5
Time limit: 1.0s
Memory limit: 64M

Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

You are about to make a delicious sandwich with layers. You are going to put the sandwich together layer by layer. For each layer, you may choose to put it at either the bottom or the top of the currently made sandwich.

At the end of it all, you wish to observe your delicious sandwich – output the layers of the sandwich from top to bottom.

#### Input Specification

The integer , followed by a sequence of 1s and 0s describing the process you followed creating the sandwich. The -th character defines what you did with the -th layer. 0 indicates you are putting the layer at the bottom of the sandwich, and 1 indicates you are putting it at the top.

#### Output Specification

The layers of the sandwich, in order from top to bottom.

#### Sample Input

5
00110

#### Sample Output

4
3
1
2
5