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 <cstdio>
#include <iostream>
#include <string>
using namespace std;

int main(){
  int i,j,v,d,a[10002],n,c,tmp;

  while(scanf("%d%d",&v,&d) != EOF){
    c = 1;
    a[0] = 1;
    a[1] = 2;
    
    for(i=2;i<=v;i++) a[i] = (a[i-1] + a[i-2]) % 1001;
    
    for(i=v;i>1;i--){
      for(j=1;j<i;j++){
	if(a[j+1] < a[j]){
	  tmp = a[j];
	  a[j] = a[j+1];
	  a[j+1] = tmp;
	}
      }
    }
    
    for(i=2;i<=v;i++){
      if(a[i] - a[i-1] >= d) c++;
    }
    
    cout << c << endl;
    
  }
  return 0;
}