import java.util.Scanner;
/**
* @author Oxygen
* @date 2018年9月1日
*/
public class cutRod {
public static void main(String[] args) {
int[][] data = new int[][] { { 1, 2 }, { 2, 5 }, { 3, 8 }, { 4, 9 }, { 5, 10 }, { 6, 17 }, { 7, 17 }, { 8, 20 },
{ 9, 24 }, { 10, 30 } };
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt(); //钢条长度
int[][] dp = new int[11][N + 1];
dp[1][1] = 1;
for (int i = 1; i < 11; i++) {
for (int j = 1; j < N + 1; j++) {
if (j >= data[i - 1][0]) {
dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - data[i - 1][0]] + data[i - 1][1]);
} else {
dp[i][j] = dp[i - 1][j];
}
}
}
System.out.println(dp[10][N]);
}
}