No Teen Sum

Background

Congcong is learning programming and encountered an interesting problem. He needs to calculate the sum of three integers, but with special rules for certain numbers.

Problem Description

Given three integer values, $a, b, c$, return their sum. However, if any of the values is a "teen" -- in the range $13..19$ inclusive -- then that value counts as $0$, except $15$ and $16$ do not count as teens. Write a separate helper function public int fixTeen(int n) that takes an integer value $n$ and returns that value fixed for the teen rule. In this way, you avoid repeating the teen code three times (i.e., "decomposition"). Define the helper below and at the same indent level as the main sum logic.

Input Format

Input is given from standard input in the following format.

$a$ $b$ $c$

Output Format

Output is printed to standard output in the following format.

$sum$

Sample

1 2 3

6

2 13 1

3

2 1 14

3

Sample Explanation

• Sample 1: $1, 2, 3$ are not in the $13..19$ range, so the sum is $1+2+3=6$.
• Sample 2: $13$ is a teen number, fixed to $0$. So the sum is $2+0+1=3$.
• Sample 3: $14$ is a teen number, fixed to $0$. So the sum is $2+1+0=3$.

Constraints

Time limit $1$ second, memory limit $1024$ KiB for each test case.