# Solution of;
# Project Euler Problem 249: Prime Subset Sums
# https://projecteuler.net/problem=249
# 
# Let S = {2, 3, 5, . . . , 4999} be the set of prime numbers less than 5000. 
# Find the number of subsets of S, the sum of whose elements is a prime 
# number. Enter the rightmost 16 digits as your answer.
# 
# by lcsm29 http://github.com/lcsm29/project-euler
import timed


def dummy(n):
    pass


if __name__ == '__main__':
    n = 1000
    i = 10000
    prob_id = 249
    timed.caller(dummy, n, i, prob_id)
