Let an infinite sequence of numbers, composed as follows: \textbf{A_\{0 \}= 1, A_1 = 12,…,A_9 = 12345678910, A_10 = 1234567891011, …}. That is, each successive term is obtained by assigning the sequence at the end of the previous member for decimal numbers, one greater than the value of the index of the term of the sequence. It is necessary to determine the total number of members of the sequences that without the rest are divisible by \textbf{4}, among those whose index belongs to the segment \[\textbf{m}, \textbf{n}\], where \textbf{0} ≤ \textbf{m} ≤ \textbf{n} ≤ \textbf{10^18}. \InputFile The only line of the input file are given two non-negative integers \textbf{m} and \textbf{n}. \OutputFile The only line of the output file a single integer - the answer of the problem.