30570번 - Mini-Tetris 3023 다국어

문제

A guy named Gry found a new game called "Mini-Tetris 3023". This small version of Tetris is played on a very long grid only 2ドル$ cells high and has just three types of tile:

• A square made out of 4ドル$ tiles in a 2ドル \times 2$ grid.
• An S-tile made out of 4ドル$ tiles, 2ドル$ on one row and 2ドル$ slightly offset on the other
• A corner made out of 3ドル$ tiles, 1ドル$ on one row and 2ドル$ on the other

Tiles may be rotated 0ドル,ドル 90ドル,ドル 180ドル,ドル or 270ドル$ degrees to fit amongst each other, however, they cannot overlap or go outside the vertical boundary of the grid.

This game provides $a$ squares, $b$ S-tiles, and $c$ corners. Gry would like to beat the high score by creating the largest-possible contiguous 2ドル \times n$ rectangle out of some or all of the provided tiles, without any tiles overlapping or sticking out of the rectangle.

입력

• The sole line of input contains three integers $a,ドル $b,ドル and $c$ (0ドル \leq a, b, c \leq 50$) --- the number of squares, S-tiles, and corners, respectively.

출력

Output the maximum possible width of the grid, $n,ドル that can be perfectly filled by some or all of the given tiles without overlapping or overstepping the boundaries.

제한

힌트