#!/usr/bin/env python

def abn(val):				# 'abn' function checks if
	sm=1				# the value is an abundant					
	for div in xrange(2,val):	# number or not (deficient).
		if val%div == 0:	# It returns:
			sm=sm+div	# 0 -> abundant;
	if sm > val:			# 1 -> deficient.
		return 0
	else:
		return 1

ab=[]					# 'ab' is the abundants list
sm=[]					# and 'sm' the sums.
for val in xrange(12,28123):
		if abn(val) == 0:
			ab.append(val)
l=len(ab)				# 'l' is used to maintain
for i in xrange(l):			# the length of lists.
	for j in xrange(i,l):
		res=ab[i]+ab[j]
		sm.append(res)
sm=list(set(sm))
l=len(sm)
res=66
for val in xrange(12,28123):
	flag=0
	for i in xrange(l):
		if val == sm[i]:
			flag=1
			i=l
	if flag == 0:
		res=res+val
print res