int IsLuhn( unsigned int pan [] )
{
	int i;
	unsigned int sum = 0;
	for( i=0; i<15; i++ ){
		if( i % 2 )
			sum += pan[i];
		else{
			int t = pan[i]*2;
			sum += (t >= 10)? t-9 : t;
		}
	}
	return ( pan[15] == ( 10 - ( sum % 10 ) ) );
}