Codeforces 669B Little Artem and Grasshopper【思维+模拟】

B. Little Artem and Grasshopper

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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 ≤ 10⁹) — the length of the jump from the i-th cell.

Output

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

Examples

Input

2
><
1 2

Output

FINITE

Input

3
>><
2 1 1

Output

INFINITE

Note

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*N的地方，每个格子都有一个方向键，表示走到这个位子的时候需要往哪个方向走，走的长度为di.

问是否能够走出这个地方，从左边出去或者右边出去都算出去。

思路：

对于不能出去的情况，其实就是出现了某个格子走过两次的时候。如果对于一个格子来讲走过了第一次还要走第二次，那么肯定再走下去还是会回到这个位子，会再次走环路。

那么我们设定一个数组vis【i】表示位子i是否已经走过了，如果已经走过了又走了上去，那么就是肯定无法出去的情况。相反，如果某一时刻走了出去，就是能够走出去的情况。过程维护一下就行了。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char a[1000000];
int vis[1000000];
int d[1000000];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",a+1);
        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;i++)scanf("%d",&d[i]);
        int flag=0;
        int now=1;
        while(now<=n&&now>=1)
        {
            //printf("%d\n",now);
            if(vis[now]==1)
            {
                flag=0;
                break;
            }
            vis[now]=1;
            if(a[now]=='<')now-=d[now];
            else now+=d[now];
            if(now>n||now<1)
            {
                flag=1;
                break;
            }
        }
        if(flag==1)printf("FINITE\n");
        else printf("INFINITE\n");
    }
}