Write me a program in Python that finds the first value which can be written as the sum of primes in over three thousand different ways.
system
mujhe paythan main ek kaarykram likhen jo pehla mulya paata he jise teen hajaar se adhik alag -alag tareekon se primes ke yoga ke rup main likhaa ja saktaa he.
user
yahaan ek kaarykram kaa ek udhaaharan diya gaya he jo pehle number ke liye hal karata he jise 3 hajaar se adhik vibhinn tareekon se primes ke yoga ke rup main likhaa ja saktaa he.

Eulerlib, itertools aayaat karen

def sumofprimes ():
cond = lambda n: num_prime_sum_ways (n)> = 3000
ANS = aglaa (filter (COND, ITERTOOLS.COUNT (2)))
ritern stre (ANS)

def num_prime_sum_ways (n):
main range main (primes [-1] + 1, n + 1) ke liye:
agar eulerlib.is_prime (i):
primes.append (i)
tareeke = [1] + [0] * n
primes main p ke liye:
main range main (n + 1 - p) ke liye:
tareeke [i + p] + = tareeke [i]
tareeke lautaaen [n]
assistant
<|system|>
</s>
<|user|>
mujhe paythan main ek kaarykram likhen jo pehla mulya paata he jise teen hajaar se adhik alag -alag tareekon se primes ke yoga ke rup main likhaa ja saktaa he.</s>
<|assistant|>
yahaan ek kaarykram kaa ek udhaaharan diya gaya he jo pehle number ke liye hal karata he jise 3 hajaar se adhik vibhinn tareekon se primes ke yoga ke rup main likhaa ja saktaa he.

Eulerlib, itertools aayaat karen

def sumofprimes ():
cond = lambda n: num_prime_sum_ways (n)> = 3000
ANS = aglaa (filter (COND, ITERTOOLS.COUNT (2)))
ritern stre (ANS)

def num_prime_sum_ways (n):
main range main (primes [-1] + 1, n + 1) ke liye:
agar eulerlib.is_prime (i):
primes.append (i)
tareeke = [1] + [0] * n
primes main p ke liye:
main range main (n + 1 - p) ke liye:
tareeke [i + p] + = tareeke [i]
tareeke lautaaen [n]</s>
