import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {

	public static boolean is_kadomatsu(int[] as){
		if(as[0] == as[1] || as[1] == as[2] || as[2] == as[0]){
			return false;
		}else if(as[0] < as[1] && as[1] > as[2]){
			return true;
		}else if(as[0] > as[1] && as[1] < as[2]){
			return true;
		}else{
			return false;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int as[] = new int[3];
		for(int i = 0; i < 3; i++){
			as[i] = sc.nextInt();
		}
		
		if(is_kadomatsu(as)){
			System.out.println("INF");
		}else{
			int answer = 0;
			int[] p_as = new int[3];
			for(int p = 1; p <= 1000; p++){
				for(int i = 0; i < 3; i++){
					p_as[i] = as[i] % p;
				}
				
				if(is_kadomatsu(p_as)){
					answer++;
				}
			}
			
			System.out.println(answer);
		}
	}

}