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 <iostream>
#include <vector>
#include <cstdlib>
using namespace std;

const int N = 1001;
int F[1001];
int V, d;

vector<int> Alist[1001];

int f(int n)
{
  if (n == -1) return 1;
  else if (n == 0) return 1;
  else if (n <= 1000) return F[n];
  else return -1;
}

void dfs(int v, bool *visited)
{
  visited[v] = true;
  for (int i=0;i<Alist[v].size();i++)
  {
    int w = Alist[v][i];
    if (!visited[w]) dfs(w, visited);
  }
  return;
}


int num_components()
{
  bool visited[1001];
  int n = 0;
  for (int i=1;i<=V;i++) visited[i]=false;
  for (int v=1;v<=V;v++)
  {
    if (!visited[v])
    {
      dfs(v, visited);
      n++;
    }
  }
  return n;
}

int main()
{
  while (cin >> V >> d)
  {
    for (int i=1;i<=V;i++)
      F[i] = ((f(i-1) % N)+ (f(i-2) % N)) % N;

    for (int i=1;i<=V;i++) Alist[i].clear();
    for (int i=1;i<=V;i++)
    {
      for (int j=i+1;j<=V;j++)
      {
        if (abs(f(i)-f(j)) < d)
        {
          Alist[i].push_back(j);
          Alist[j].push_back(i);
        }
      }
    } // Graph created
    int res = num_components();
    cout << res << endl;
  }
  return 0;
}