Reverse I

Problem Statement

This problem is worth 3 tokens.

Input Format

Your first line of input will contain $n$. Your next line will contain a string of length $n$ consisting of only $0$ and $1$ characters.

Sample Cases

10
1001001001

2

10
1000101001

3

10
1110101001

5