Codeforce The Eternal Immortality

The Eternal Immortality

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Even if the world is full of counterfeits, I still regard it as wonderful.

Pile up herbs and incense, and arise again from the flames and ashes of its predecessor — as is known to many, the phoenix does it like this.

The phoenix has a rather long lifespan, and reincarnates itself once everya! years. Here a! denotes the factorial of integera, that is, a! = 1 × 2 × ... × a. Specifically,0! = 1.

Koyomi doesn't care much about this, but before he gets into another mess with oddities, he is interested in the number of times the phoenix will reincarnate in a timespan ofb! years, that is, . Note that whenb ≥ a this value is always integer.

As the answer can be quite large, it would be enough for Koyomi just to knowthe last digit of the answer in decimal representation. And you're here to provide Koyomi with this knowledge.

Input

The first and only line of input contains two space-separated integersa and b (0 ≤ a ≤ b ≤ 10¹⁸).

Output

Output one line containing a single decimal digit — the last digit of the value that interests Koyomi.

Examples

Input

2 4

Output

2

Input

0 10

Output

0

Input

107 109

Output

2

Note

In the first example, the last digit of is 2;

In the second example, the last digit of is 0;

In the third example, the last digit of is 2.

题意：

输入两个数，求后一个数的阶乘除以前一个数阶乘，再取个位的值。

思路：

只要有2和5倍数的数，结果就为0，如果不是则最多是4个数相乘，很容易算出。

代码：

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
	long long n,m;
	cin>>n>>m;
	long long ans=1;
	for(long long i=n+1; i<n+6 && i<=m ; i++)
	{
		ans*=(i%10);
		ans%=10;
	}
	cout<< ans <<endl;
	return 0;
}