import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T read(T)(){ return read.to!T; }
T[] read(T)(long n){ return n.iota.map!(_ => read!T).array; }
T[][] read(T)(long m, long n){ return m.iota.map!(_ => read!T(n)).array; }
// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	int n = read.to!int;
	int[] as;
	foreach(i; 0 .. n) as ~= read.to!int;
	// 1: Circle, 2: Triangle, 3: Square
	
	long ans;
	bool f; // was 3 -> 1.
	foreach(i; 0 .. n - 1){
		int a = as[i] * 10 + as[i + 1];
		switch(a){
			case 11: case 22: case 33: case 23: case 32:
				writeln("Infinite");
				return;
			case 12:
				if(f) ans += 2;
				else ans += 3;
				f = 0;
				break;
			case 13:
				ans += 4;
				f = 0;
				break;
			case 21:
				ans += 3;
				f = 0;
				break;
			case 31:
				ans += 4;
				f = 1;
				break;
			default: 
				assert(0);
		}
	}
	
	writeln("Finite");
	ans.writeln;
}
