m=1262+1261
n=gets.to_i
def gcd(a,b)
	a, b = b, a%b while b > 0
	a
end
res = []
(2..n).to_a.reverse.each{|k|
	r = [k]
	(2..k).to_a.reverse.each{|i| r.all?{|j| gcd(j,i)==1} && r.reduce(:+)+i <= m ? r.push(i) : r }
	res.push(r)
}
puts res.sort{|a,b| b.reduce(:+)<=>a.reduce(:+) }[0].reduce(:+)