//Кузнечик
#include <iostream>

int main() {
  int a, P, H, t1 = -1, t2 = -1;
  std::cin >> a >> P >> H;
  if (abs(H - P) % a == 0) {
    t1 = abs(H - P) / a;

  }
  if (H % a == 0 && P % a == 0) {
    t2 = H / a + P / a;

  } else if (H % a == 0 && P % a != 0) {
    t2 = H / a + P / a + 1;
  }
  if (t1 < 0 || t2 < 0) {
    std::cout << std::max(t1, t2);

  } else {
    std::cout << std::min(t1, t2);
  }

  return 0;
}
//Lifts
#include <iostream>

int main() {
  int N, K, T, L, maxnear, minnear;
  std::cin >> N >> K >> T >> L;
  if (K % T <= L) {
    std::cout << K << std::endl;

  } else if (K / T + 1 < N / T) {
    maxnear = T * (K / T + 1) + 1;
    minnear = K / T * T + L;
    std::cout << ((maxnear - K <= K - minnear) ? maxnear : minnear) << std::endl;

  } else if (N / T == K / T + 1) {
    minnear = K / T * T + L;
    std::cout << minnear << std::endl;

  }

  return 0;
}
//Chet nechet
#include <iostream>

int main() {
  int A, B, C, nechet;
  std::cin >> A >> B >> C;
  nechet = abs(A % 2) + abs(B % 2) + abs(C % 2);
  if (nechet > 0 && nechet < 3) {
    std::cout << "YES" << std::endl;
  } else {
    std::cout << "NO" << std::endl;
  }
  return 0;
}