Fibonacci number f(i) appear in a variety of puzzles in nature and math, including packing problems, family trees or Pythagorean triangles. They obey the rule f(i) = f(i - 1) + f(i - 2), where we set f(0) = 1 = f(-1).

Let V and d be two certain positive integers and be N ≡ 1001 a constant. Consider a set of V nodes, each node i having a Fibonacci label F[i] = (f(i) mod N) assigned for i = 1,..., V ≤ N. If |F(i) - F(j)| < d, then the nodes i and j are connected.

Given V and d, how many connected subsets of nodes will you obtain?

<image>

Figure 1: There are 4 connected subsets for V = 20 and d = 100.

Constraints

* 1 ≤ V ≤ 1000
* 1 ≤ d ≤ 150

Input

Each data set is defined as one line with two integers as follows:

Line 1: Number of nodes V and the distance d.

Input includes several data sets (i.e., several lines). The number of dat sets is less than or equal to 50.

Output

Output line contains one integer - the number of connected subsets - for each input line.

Example

Input

5 5
50 1
13 13


Output

2
50
8
#include <bits/stdc++.h>
using namespace std;

using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T> constexpr T inf = numeric_limits<T>::has_infinity ? numeric_limits<T>::infinity() : numeric_limits<T>::max() / 4;

#define REP(i, stop) FOR(i, 0, stop)
#define FOR(i, start, stop) for (int i = start, i##_len = stop; i < i##_len; ++i)
#define RREP(i, n) for (int i = n; i-- > 0;)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define COMP(key) [](const auto& a, const auto& b) { return a.key < b.key; }

struct InitCpp { InitCpp() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } initCpp;

class UnionFind { private: std::vector<size_t> P; std::vector<size_t> S; public: size_t find(size_t x) { return P[x] == x ? x : P[x] = find(P[x]); } public: UnionFind(size_t n) { P.resize(n); iota(P.begin(), P.end(), 0); S.resize(n); fill(S.begin(), S.end(), 1); } void unite(size_t x, size_t y) { x = find(x); y = find(y); if (x == y) return; if (S[x] < S[y]) { P[x] = y; S[y] += S[x]; } else { P[y] = x; S[x] += S[y]; } } bool same(size_t x, size_t y) { return find(x) == find(y); } size_t size(size_t x) { return S[find(x)]; } };

signed main() {
  vector<i64> F(1001);
  F[0] = 1;
  F[1] = 2;
  FOR(i, 2, 1001) {
    F[i] = (F[i - 1] + F[i - 2]) % 1001;
  }
  i64 v, d;
  while (cin >> v >> d) {
    UnionFind uf(v + 1);
    for (i64 i = 1; i <= v; ++i) {
      for (i64 j = i + 1; j <= v; ++j) {
        if (abs(F[i] - F[j]) < d) {
          uf.unite(i, j);
        }
      }
    }
    set<i64> roots;
    for (i64 i = 1; i <= v; ++i) {
      roots.insert(uf.find(i));
    }
    cout << roots.size() << endl;
  }
}

