from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from heapq import heappop, heappush
import math, sys
# input = sys.stdin.readline
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

L, R = map(int, input().split())

S = set()
for i in range(L, R+1):
    if i <= 295:
        S.add("a")
    elif i <= 416:
        S.add("b")
    else:
        S.add("c")

print(len(S)-1)