#include <iostream>
#include <algorithm>
#include <climits>
using namespace std;

int main() {
    int A[3], B[3], ans = 0, minA = INT_MAX, maxA = INT_MIN, minB, maxB;
    for (int i = 0; i < 3; ++i) {
        cin >> A[i];
        minA = min(minA, A[i]);
        maxA = max(maxA, A[i]);
    }
    if (A[0] != A[1] && A[1] != A[2] && A[0] != A[2] && (A[1] == minA || A[1] == maxA)) cout << "INF";
    else {
        for (int i = 1; i <= maxA; ++i) {
            minB = INT_MAX;
            maxB = INT_MIN;
            for (int j = 0; j < 3; ++j) {
                B[j] = A[j] % i;
                minB = min(minB, B[j]);
                maxB = max(maxB, B[j]);
            }
            if (B[0] != B[1] && B[1] != B[2] && B[0] != B[2] && (B[1] == minB || B[1] == maxB)) ++ans;
        }
        cout << ans;
    }
}