Returns the prime number that can written as sum of longest chain of consecutive primes .
static void LSCP ( int [ ] arr , int n ) { sieveSundaram ( ) ; long [ ] sum_prime = new long [ primes . Count + 1 ] ;