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;

int main()
{
    int V, d;
    
    while (scanf("%d %d", &V, &d) == 2){
        vector<int> a(V);
        
        a[0] = 2;
        for (int i = 1; i < V; i++){
            if (i == 1) a[i] = 3;
            else a[i] = (a[i - 1] + a[i - 2]) % 1001;
        }
        
        sort(a.begin(), a.end());
        
        int ct = 1;
        for (int i = 1; i < V; i++) if (a[i] - a[i - 1] >= d) ct++;
        
        printf("%d\n", ct);
    }
    
    return (0);
}