CF641A Little Artem and Grasshopper
题目描述
有一只蚱蜢和一个有着$n$个格子的条子,蚱蜢刚开始在第$1$个格子上。每个格子上都标有下次跳的方向以及距离。当蚱蜢跳出边界时就会停止。请问蚱蜢是否会一直跳下去?
输入格式
第一行,一个正整数$n$($1$
输出格式
如果蚱蜢会永远跳下去,输出`INFINITE`,否则输出`FINITE`。
$Translate$ $by$ $U144044$
$\color{white}\texttt{蚱蜢永远跳下去不会累死吗}$
说明/提示
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.