Prince Ljubinko decided to build a bridge over the river in his home town. He gathered the best master builders, who started building a stone bridge. In the quarries they cut huge stone slabs of equal size, which they placed on pillars, and that was the base of the bridge. The width of a slab always determined the width of the bridge. So that the edges of these slabs would not get damaged over time, after laying the slabs in a row they placed small square slabs, 1 metre on each side, around these large slabs. Write a program BRIDGE in which the width of a slab S and the length of a slab D, given in metres, and the number of slabs N needed to make the base of one bridge are entered, and then
the number of small square slabs needed along the edges of the bridge is calculated.
The values of the variables S, D and N are positive integers, 0 < S, D, N ≤ 100
Example. Input: S = 5 D = 7 N = 3 Output: 56
Note: A task from the municipal competition, season 2009/2010, dms.rs/pripreme-informatika/