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
def initSets(N):
    return [ x for x in range(N) ]

def getRoot(arr, n):
    while arr[n] != n:
        arr[n] = arr[arr[n]]
        n = arr[n]
    return n

def union(arr, n, m):
    a = getRoot(arr, n)
    b = getRoot(arr, m)
    if a != b:
        arr[a] = b

def isSameSet(arr, n, m):
    return getRoot(arr, n) == getRoot(arr, m)

def getFibs():
    fibs = []
    a = 1
    b = 1
    while len(fibs) < 1000:
        c = (a + b) % 1001
        a = b
        b = c
        fibs.append(c)
    return fibs
        
if __name__ == '__main__':
    try:
        FIBS = getFibs()
        while True:
            V, d = list(map(int, input().strip().split()))

            fibs = FIBS[:V]
            arr = initSets(V)

            for i in range(V):
                for j in range(i + 1, V):
                    if abs(fibs[i] - fibs[j]) < d:
                        union(arr, i, j)
            
            subsets = {}
            for i in range(V):
                root = getRoot(arr, i)
                if root in subsets:
                    subsets[root].append(fibs[i])
                else:
                    subsets[root] = [fibs[i]]

            print(len(subsets))

    except EOFError:
        pass
