#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int a, b, c; cin >> a >> b >> c;
  if (gcd(gcd(a, b), c) > 1) {
    cout << "INF\n";
    return 0;
  }
  if (a > b) swap(a, b);
  if (b > c) swap(b, c);
  if (a > b) swap(a, b);
  vector<int> dist(a, INF);
  dist[0] = 1;
  chmin(dist[b % a], b / a);
  chmin(dist[c % a], c / a);
  using P = pair<int, int>;
  priority_queue<P, vector<P>, greater<P>> que;
  que.emplace(1, 0);
  que.emplace(b / a, b % a);
  que.emplace(c / a, c % a);
  while (!que.empty()) {
    auto [cost, n] = que.top(); que.pop();
    if (cost > dist[n]) continue;
    if (int nx = dist[n] + b / a + (b % a >= a - n); dist[(n + b) % a] > nx) {
      dist[(n + b) % a] = nx;
      que.emplace(nx, (n + b) % a);
    }
    if (int nx = dist[n] + c / a + (c % a >= a - n); dist[(n + c) % a] > nx) {
      dist[(n + c) % a] = nx;
      que.emplace(nx, (n + c) % a);
    }
  }
  cout << accumulate(dist.begin() + 1, dist.end(), 0) << '\n';
  return 0;
}