#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <utility>

using namespace std;

int maxn = 1000;
int n = 1001;
int tree[1000];
int fib[1000];

int root(int a);
bool is_same_set(int p, int q);
void joint(int x, int y);
void makefib(int maxn);

int main()
{
    makefib(1000);
    int v, d, res;
    while (cin >> v)
    {
        if (cin.eof())
            break;
        cin >> d;

        for (int i = 0; i < maxn; i++)
        {
            tree[i] = i;
        }
        for (int i = 0; i < v; i++)
        {
            for (int j = i; j < v; j++)
            {
                if (abs(fib[i] - fib[j]) < d)
                {
                    joint(i, j);
                }
            }
        }
        res = 0;
        for (int i = 0; i < v; i++)
        {
            if (root(i) == i)
            {
                res++;
            }
        }
        cout << res << endl;
    }

    return 0;
}

void makefib(int maxn)
{
    fib[0] = 2;
    fib[1] = 3;

    for (int i = 2; i < maxn; i++)
    {
        fib[i] = (fib[i - 1] + fib[i - 2]) % n;
    }
}

int root(int a)
{
    if (tree[a] == a)
    {
        return a;
    }
    else
    {
        tree[a] = root(tree[a]);
        return tree[a];
    }
}

bool is_same_set(int p, int q)
{
    return root(p) == root(q);
}

void joint(int x, int y)
{
    tree[root(x)] = root(y);
}

