Game
Two players play a graph coloring game. They make moves in turn, first player moves first. Initially they take some undirected graph. At each move, a player can color an uncolored vertex with either white or black color (each player can use any color, possibly different at different turns). It's not allowed to color two adjacent vertices with the same color. A player that can't move loses.
After playing this game for some time, they decided to study it. For a start, they've decided to study very simple kind of graph - a chain. A chain consists of n vertices, v[1], v[2], ... , v[n], and n - 1 edges, connecting v[1] with v[2], v[2] with v[3], ..., v[n-1] with v[n].
Given a position in this game, and assuming both players play optimally, who will win?
Input
The first line contains the integer n (1 ≤ n ≤ 10^5).
The second line describes the current position. It contains n digits without spaces. i-th digit describesthe color of vertex v[i]: 0 - uncolored, 1 - black, 2 - white. No two vertices of the same color are adjacent.
Output
On the only line print FIRST if the player moving first in that position wins the game, and SECOND otherwise.