#include <iostream>
#include <math.h>
using namespace std;
 
int main() {
	long long prime[2014]={2,3,5,7},i,j,k,count=4,modprod=1;
	bool ch;
	for(i=9;count<2015;i+=2)
		{
			k=count;
			while(prime[k-1]>sqrt(i))
				k--;
			ch=true;
			for(j=1;j<k;j++)
				{
					if(i%prime[j]==0)
						ch=false;
				}
			if(ch==true)
				{
					prime[count]=i;
					count++;
				}
		}
	for(i=0;i<2014;i++)
		{
			modprod*=prime[i];
			modprod%=1000;
		}
	cout<<modprod;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWF0aC5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7Cglsb25nIGxvbmcgcHJpbWVbMjAxNF09ezIsMyw1LDd9LGksaixrLGNvdW50PTQsbW9kcHJvZD0xOwoJYm9vbCBjaDsKCWZvcihpPTk7Y291bnQ8MjAxNTtpKz0yKQoJCXsKCQkJaz1jb3VudDsKCQkJd2hpbGUocHJpbWVbay0xXT5zcXJ0KGkpKQoJCQkJay0tOwoJCQljaD10cnVlOwoJCQlmb3Ioaj0xO2o8aztqKyspCgkJCQl7CgkJCQkJaWYoaSVwcmltZVtqXT09MCkKCQkJCQkJY2g9ZmFsc2U7CgkJCQl9CgkJCWlmKGNoPT10cnVlKQoJCQkJewoJCQkJCXByaW1lW2NvdW50XT1pOwoJCQkJCWNvdW50Kys7CgkJCQl9CgkJfQoJZm9yKGk9MDtpPDIwMTQ7aSsrKQoJCXsKCQkJbW9kcHJvZCo9cHJpbWVbaV07CgkJCW1vZHByb2QlPTEwMDA7CgkJfQoJY291dDw8bW9kcHJvZDsKCXJldHVybiAwOwp9