#include <cstdlib>
#include <algorithm>
#include <array>
#include <iostream>

static constexpr int A_MAX = 1000;


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

  std::array<int, 3> as;
  std::cin >> as[0] >> as[1] >> as[2];
  if (as[0] == as[1] || as[1] == as[2] || as[2] == as[0]) {
    std::cout << 0 << std::endl;
    return EXIT_SUCCESS;
  }

  auto mm = std::minmax_element(as.begin(), as.end());
  if (as.begin() + 1 == mm.first || as.begin() + 1 == mm.second) {
    std::cout << "INF" << std::endl;
    return EXIT_SUCCESS;
  }

  int cnt = 0;
  std::array<int, 3> bs;
  for (int i = 1, iMax = *std::max_element(as.begin(), as.end()); i <= iMax; i++) {
    for (decltype(as)::size_type j = 0; j < as.size(); j++) {
      bs[j] = as[j] % i;
    }
    if (bs[0] == bs[1] || bs[1] == bs[2] || bs[2] == bs[0]) {
      continue;
    }
    auto mm = std::minmax_element(bs.begin(), bs.end());
    if (bs.begin() + 1 == mm.first || bs.begin() + 1 == mm.second) {
      cnt++;
    }
  }
  std::cout << cnt << std::endl;

  return EXIT_SUCCESS;
}