#include <bits/stdc++.h>
using namespace std;
const int MX = 3e5 + 5;
const int mod = 1e9 + 9;
const int INF = 0x3f3f3f3f;
long long solve(long long a, long long b, long long k) {
  return b / k - (a - 1) / k;
}
int main() {
  long long k, a, b;
  while (~scanf("%I64d%I64d%I64d", &k, &a, &b)) {
    if (a <= 0 && b <= 0) a = -a, b = -b;
    if (a > b) swap(a, b);
    long long ret = 0;
    if (a > 0)
      ret = solve(a, b, k);
    else if (a == 0)
      ret = solve(1, b, k) + 1;
    else
      ret = solve(1, -a, k) + solve(1, b, k) + 1;
    printf("%I64d\n", ret);
  }
  return 0;
}
