#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class t>
using table = vector<vector<t>>;
const ld eps = 1e-9;

//// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
  

int main() {
	int V, D;
	int aa = 1001;
	while (cin >> V >> D) {
		vector<int>fib(V+1);
		fib[0] = 1%aa;
		fib[1] = 2%aa;
		for (int i = 2; i <= V; ++i) {
			fib[i] = (fib[i - 1] + fib[i - 2])%aa;
		}
		vector<int>nums;
		for (int i = 1; i <= V; ++i) {
			nums.emplace_back(fib[i]);
		}
		sort(nums.begin(), nums.end());
		nums.erase(unique(nums.begin(), nums.end()), nums.end());
		int from = -10000;
		int ans = 0;
		for (int i = 0; i < nums.size(); ++i) {
			if (from + D <= nums[i]) {
				ans++;


			}
			from = nums[i];
		}
		cout << ans << endl;
	}
	return 0;
}