on Mondays, Thursdays and Sundays he eats fish food;

on Tuesdays and Saturdays he eats rabbit stew;

on other days of week he eats chicken stake.

Polycarp plans to go on a trip and already packed his backpack. His backpack contains:

a daily rations of fish food;

b daily rations of rabbit stew;

c daily rations of chicken stakes.

Polycarp has to choose such day of the week to start his trip that his cat can eat without additional food purchases as long as possible. Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Input

The first line of the input contains three positive integers a, b and c (1≤a,b,c≤7⋅10

^{8}) — the number of daily rations of fish food, rabbit stew and chicken stakes in Polycarps backpack correspondingly.

Output

Print the maximum number of days the cat can eat in a trip without additional food purchases, if Polycarp chooses the day of the week to start his trip optimally.

Examples:

input :

2 1 1

output:

4

input :

3 2 2

output:

7

input :

1 100 1

output:

3

input :

30 20 10

output:

39