def breakSum(n):
	MAX = 1000000
	 
	dp = [0]*(n+1) 
	dp[0] = 0
	dp[1] = 1
	for i in range(2, n+1): 
		dp[i] = max(dp[int(i/2)] + dp[int(i/3)] + dp[int(i/4)], i); 
	return dp[n]
def breakSum(n):
    MAX = 1000000
    VAR_0 = [0] * (n + 1)
    VAR_0[0] = 0
   
    VAR_0[1] = 1
    for i in range(2, n + 1):
        VAR_0[i] = max(VAR_0[int(i / 2)] + VAR_0[int(i / 3)] + VAR_0[int(i / 4)], i)
    return VAR_0[n]