#include int ri() { int n; scanf("%d", &n); return n; } int gcd(int a, int b) { while (a && b) { if (a > b) a %= b; else b %= a; } return a + b; } int main() { int a = ri(); int b = ri(); int c = ri(); if (gcd(gcd(a, b), c) != 1) { puts("INF"); return 0; } int max = 2000 * 2000; std::vector ok(max); ok[0] = true; for (int i = 0; i < max; i++) { if (!ok[i]) continue; if (i + a < max) ok[i + a] = true; if (i + b < max) ok[i + b] = true; if (i + c < max) ok[i + c] = true; } printf("%d\n", (int) std::count(ok.begin(), ok.end(), 0)); return 0; }