Maximum Sum

Problem Background

Special for beginners, ^_^

Problem Description

There are three integers $a_1, a_2, a_3$. It is known that $0 \le a_1, a_2, a_3 \le n$, and $a_1 + a_2$ is a multiple of $2$, $a_2 + a_3$ is a multiple of $3$, and $a_1 + a_2 + a_3$ is a multiple of $5$.

Your task is to find a set of $a_1, a_2, a_3$ such that $a_1 + a_2 + a_3$ is maximized.

Input Format

One line containing an integer $n\ (0 \le n \le 100)$.

Output Format

One integer, the maximum value of $a_1 + a_2 + a_3$.

Sample Input

3

Sample Output

5

Constraints

1s, 1024KiB for each test case.