Codeforces Round #348 (VK Cup 2016 Round 2, Div. 2 Edition) B

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.

题意：有n个区域 每个区域给一个固定跳跃方向‘>’代表向右 和 ‘<’代表向左 接下来的一行代表这个从这个区域能跳跃多远

若能一直跳跃输出INFINITE 否则输出FINITE

题解：存储每个位置的跳跃后的状态 暴力模拟过程

标记 若在某一个位置重复出现 则说明能够一直跳跃输出INFINITE 若跳出1~n的范围则输出FINITE

 #include<iostream>
  #include<cstring>
  #include<cstdio>
  #include<queue>
  #include<stack>
  #include<map>
  #include<set>
  #include<algorithm>
  #define ll __int64
  #define pi acos(-1.0)
  #define mod 1
  #define maxn 10000
  using namespace std;
  int n;
  map<int,char> mp;
  map<int,int> to;
  map<int,int> mpp;
  int exm;
  int main()
  {
      mp.clear();
      mpp.clear();
      to.clear();
      scanf("%d",&n);
      getchar();
      for(int i=;i<=n;i++)
         scanf("%c",&mp[i]);
      for(int i=;i<=n;i++)
      {
          scanf("%d",&exm);
          if(mp[i]=='>')
            to[i]=i+exm;
          else
            to[i]=i-exm;
     }
     exm=;
     int flag=;
     while()
     {
         if(exm>n||exm<)
         {
             flag=;
             break;
         }
         if(mpp[exm]==)
         {
             flag=;
             break;
         }
         mpp[exm]=;
         exm=to[exm];
     }
     if(flag)
    cout<<"INFINITE"<<endl;
    else
     cout<<"FINITE"<<endl;
      return ;
  }