#include using namespace std; #define int long long typedef pair P; int INF = 3e18+7; int mod = 1e9+7; int dx[] = {1, 0,-1, 0, 1, 1,-1,-1}; int dy[] = {0, 1, 0,-1, 1,-1, 1,-1}; int gcd(int X,int Y) { if(X%Y == 0) { return Y; } else { return gcd(Y,X%Y); } } int dp[4003000]; signed main() { int A,B,C; cin >> A >> B >> C; if(gcd(gcd(A,B),C) != 1) { cout << "INF" << endl; return 0; } int ans = 0; dp[0] = 1; for(int i = 0; i <= 4000000; i++) { if(dp[i] == 1) { dp[i+A] = 1; dp[i+B] = 1; dp[i+C] = 1; } else { ans++; } } cout << ans << endl; }