#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 5;
const int INF = 1e9 + 5;
const int mod = 1000000007;
const double eps = 1e-7;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
int main() {
  long long a, b, k;
  while (cin >> k >> a >> b) {
    if (b <= 0) {
      a = -a;
      b = -b;
      swap(a, b);
    }
    long long ans = b / k - a / k;
    if (a % k == 0 || a < 0) ans++;
    cout << ans << endl;
  }
  return 0;
}
