CF641A.Little Artem and Grasshopper

Little Artem found a grasshopper. He brought it to his house and constructed a jumping area for him.

The area looks like a strip of cells 1 × n. Each cell contains the direction for the next jump and the length of that jump. Grasshopper starts in the first cell and follows the instructions written on the cells. Grasshopper stops immediately if it jumps out of the strip. Now Artem wants to find out if this will ever happen.

小阿尔泰姆发现了一只蚱蜢。他把蚱蜢带回家，并为它搭建了一个跳跃区域。

该区域形如一个 $1 \times n$ 的单元格条带。每个单元格中均写有一个下一步跳跃的方向以及跳跃的长度。蚱蜢从第一个单元格出发，并依照单元格上所写的指令进行跳跃。一旦蚱蜢跳出该条带，它将立即停止跳跃。现在，阿尔泰姆想知道这种情况是否会发生。

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — length of the strip.

Next line contains a string of length n which consists of characters "<" and ">" only, that provide the direction of the jump from the corresponding cell. Next line contains n integers d__i (1 ≤ d__i ≤ 109) — the length of the jump from the i-th cell.

输入的第一行包含一个整数 $n$（$1 \leq n \leq 100\,000$）—— 表示条带的长度。

第二行包含一个长度为 $n$ 的字符串，该字符串仅由字符 < 和 > 组成，表示从对应格子出发的跳跃方向。
第三行包含 $n$ 个整数 $d_i$（$1 \leq d_i \leq 10^9$）—— 表示从第 $i$ 个格子出发的跳跃长度。

Print "INFINITE" (without quotes) if grasshopper will continue his jumps forever. Otherwise print "FINITE" (without quotes).

如果蚱蜢将永远持续跳跃，则输出 "INFINITE"（不带引号）；否则输出 "FINITE"（不带引号）。

In the first sample grasshopper starts from the first cell and jumps to the right on the next cell. When he is in the second cell he needs to jump two cells left so he will jump out of the strip.

Second sample grasshopper path is 1 - 3 - 2 - 3 - 2 - 3 and so on. The path is infinite.

在第一个样例中，蚱蜢从第一个单元格出发，向右跳到下一个单元格。当它位于第二个单元格时，需要向左跳两个单元格，因此将跳出条带。

第二个样例中，蚱蜢的路径为 $1 \to 3 \to 2 \to 3 \to 2 \to 3$，依此类推。该路径是无限的。