﻿# -*- coding: utf-8 -*-
# ProjectEuler/src/python/problem249.py
#
# Prime Subset Sums
# =================
# Published on Saturday, 13th June 2009, 05:00 am
#
# 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.

import projecteuler as pe

def main():
    pass

if __name__ == "__main__":
    main()
