B'The math faculty of Berland State University has suffered the sudden drop in the math skills of enrolling students. This year the highest grade on the entrance math test was 8. Out of 100! Thus, the decision was made to make the test easier. Future students will be asked just a single question. They are given a sequence of integer numbers a_1, a_2, ... , a_n , each number is from 1 to 3 and a_i ne a_{i + 1} for each valid i . The i -th number represents a type of the i -th figure: The figures of the given sequence are placed somewhere on a Cartesian plane in such a way that: Note that the construction is unique for some fixed position and size of just the first figure. The task is to calculate the number of distinct points (not necessarily with integer coordinates) where figures touch. The trick is, however, that the number is sometimes infinite. But that won 't make the task difficult for you, will it? So can you pass the math test and enroll into Berland State University? The first line contains a single integer n ( 2 <= n <= 100 ) -- the number of figures. The second line contains n integer numbers a_1, a_2, ... , a_n ( 1 <= a_i <= 3 , a_i ne a_{i + 1} ) -- types of the figures. The first line should contain either the word "Infinite" if the number of distinct points where figures touch is infinite or "Finite" otherwise. If the number is finite than print it in the second line. It 's guaranteed that the number fits into 32-bit integer type. Here are the glorious pictures for the examples. Note that the triangle is not equilateral but just isosceles with the length of height equal to the length of base. Thus it fits into a square in a unique way. The distinct points where figures touch are marked red. In the second example the triangle and the square touch each other for the whole segment, it contains infinite number of points. '...