// No.358 も～っと！門松列
// https://yukicoder.me/problems/no/358
//

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

bool is_kadomatsu(vector<int> &A);


int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    vector<int> A(3);
    cin >> A[0];
    cin >> A[1];
    cin >> A[2];

    if (is_kadomatsu(A)) {
        cout << "INF" << endl;
    } else {
        int ans = 0;
        for (auto p = 1; p <= *max_element(A.begin(), A.end()); ++p) {
            vector<int> B;
            B = A;
            B[0] %= p;
            B[1] %= p;
            B[2] %= p;
            if (is_kadomatsu(B))
                ++ans;
        }
        cout << ans << endl;
    }
}


bool is_kadomatsu(vector<int> &A) {
    if (A[0] == A[1] || A[1] == A[2] || A[0] == A[2])
        return false;
    return !(*max_element(A.begin(), A.end()) != A[1] && *min_element(A.begin(), A.end()) != A[1]);
}