Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Om Nom and Dark Park

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOm Nom is the main character of a game "Cut the Rope". He is a bright little monster who likes visiting friends living at the other side of the park. However the dark old parks can scare even somebody as fearless as Om Nom, so he asks you to help him.

The park consists of 2^{n + 1} - 1 squares connected by roads so that the scheme of the park is a full binary tree of depth *n*. More formally, the entrance to the park is located at the square 1. The exits out of the park are located at squares 2^{n}, 2^{n} + 1, ..., 2^{n + 1} - 1 and these exits lead straight to the Om Nom friends' houses. From each square *i* (2 ≤ *i* < 2^{n + 1}) there is a road to the square . Thus, it is possible to go from the park entrance to each of the exits by walking along exactly *n* roads.

Om Nom loves counting lights on the way to his friend. Om Nom is afraid of spiders who live in the park, so he doesn't like to walk along roads that are not enough lit. What he wants is that the way to any of his friends should have in total the same number of lights. That will make him feel safe.

He asked you to help him install additional lights. Determine what minimum number of lights it is needed to additionally place on the park roads so that a path from the entrance to any exit of the park contains the same number of street lights. You may add an arbitrary number of street lights to each of the roads.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 10) — the number of roads on the path from the entrance to any exit.

The next line contains 2^{n + 1} - 2 numbers *a*_{2}, *a*_{3}, ... *a*_{2n + 1 - 1} — the initial numbers of street lights on each road of the park. Here *a*_{i} is the number of street lights on the road between squares *i* and . All numbers *a*_{i} are positive integers, not exceeding 100.

Output

Print the minimum number of street lights that we should add to the roads of the park to make Om Nom feel safe.

Examples

Input

2

1 2 3 4 5 6

Output

5

Note

Picture for the sample test. Green color denotes the additional street lights.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/28/2017 22:23:16 (c2).

Desktop version, switch to mobile version.

User lists

Name |
---|