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<algorithm>
#include<vector>
#include<cstdlib>
#define FLG 1001
using namespace std;
class DisjointSet{
private:
  vector<int> rank,p;
  int fib[FLG+1];
  void link(int x,int y){
    if(rank[x] > rank[y]){
      p[y] = x;
    }else{
      p[x] = y;
      if(rank[x] == rank[y]) rank[y]++;
    }
  }
public:
  DisjointSet(){}
  DisjointSet(int size){
    rank.resize(size+1,0);
    p.resize(size+1,0);
    FIB();
  }
  void makeSet(int x){
    p[x] = x;
    rank[x] = 0;
  }
  void Union(int x,int y){
    link(findSet(x),findSet(y));
  }
  int findSet(int x){
    if(x != p[x]) p[x] = findSet(p[x]);
    return p[x];
  }
  bool isSameOut(int x,int y){
    return (findSet(x)==findSet(y));
  }
  void FIB(){
    fib[0]=2,fib[1]=3,p[0]=0,p[1]=1;
    for(int i=2;i<=FLG;i++){
      fib[i] = (fib[i-1]+fib[i-2]) % FLG;
      p[i] = i;
    }
  }
  int FIBGET(int x){
    return fib[x];
  }
};
int main(){
  int V,d;
  while(cin >> V >> d){
    DisjointSet D(1001);
    for(int i=0,l=V%FLG;i<l;i++){
      for(int j=i+1;j<l;j++){
	int a=D.FIBGET(i),b=D.FIBGET(j);
	if(abs(a-b)<d){
	  if(!D.isSameOut(i,j)) D.Union(i,j);
	}
      }
    }
    int ans = 0,list[1002]={0};
    for(int i=0,l=V%FLG;i<l;i++){
      int root = D.findSet(i);
      if(list[root]==0){
	list[root]=1;
	ans++;
      }
    }
    cout << ans << endl;
  }
}