#abc236f. F - Spices

F - Spices

Score : 500500 points

问题描述

商店 supaisu-ya 销售 2N12^N-1 种香料:香料 11、香料 22、……、香料 2N12^N-1。每种香料库存一包。对于每个 i=1,2,,2N1i = 1, 2, \ldots, 2^N-1,香料 ii 的价格为 cic_i 日元。Takahashi 可以购买这些香料中的任意一种。

他计划在回家后选择并混合所购买的一种或多种香料来制作咖喱。
如果混合了 kk 种香料,即香料 A1A_1、香料 A2A_2、……、香料 AkA_k,那么得到的咖喱辣度为 A1A2AkA_1 \oplus A_2 \oplus \cdots \oplus A_k,其中 \oplus 表示按位异或运算。

根据回家后的感受,Takahashi 想决定咖喱的辣度。现在,他将购买一组香料,使得他能制作出从 112N12^N-1 的任何辣度的咖喱。请输出 Takahashi 最少需要支付的金额。

以上为通义千问 qwen-max 翻译,仅供参考。

Problem Statement

The shop supaisu-ya sells 2N12^N-1 kinds of spices: Spice 11, Spice 22, \ldots, Spice 2N12^N-1. One pack of each spice is in stock. For each i=1,2,,2N1i = 1, 2, \ldots, 2^N-1, Spice ii costs cic_i yen. Takahashi can buy any of these spices.

He plans to make curry after getting home by choosing one or more of the bought spices and mixing them.
If kk spices, Spice A1A_1, Spice A2A_2, \ldots, Spice AkA_k, are mixed, the hotness of the resulting curry is A1A2AkA_1 \oplus A_2 \oplus \cdots \oplus A_k, where \oplus denotes the bitwise XOR.

Takahashi wants to decide the hotness of the curry based on his feeling after getting home. For now, he will buy a set of spices that allows him to make curry of any hotness from 11 through 2N12^N-1. Print the minimum possible amount of money Takahashi pays.

Constraints

  • 2N162 \leq N \leq 16
  • 1ci1091 \leq c_i \leq 10^9
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

NN

c1c_1 c2c_2 \ldots c2N1c_{2^N-1}

Output

Print the minimum possible amount of money Takahashi pays.

Sample Input 1

2
4 5 3

Sample Output 1

7

If Takahashi buys Spice 11 and 33, he can make curry of any hotness from 11 through 33, as follows.

  • To make curry of hotness 11, use just Spice 11.
  • To make curry of hotness 22, mix Spice 11 and Spice 33.
  • To make curry of hotness 33, use just Spice 33.

Here, Takahashi pays c1+c3=4+3=7c_1 + c_3 = 4 + 3 = 7 yen, which is the minimum possible amount he pays.

Sample Input 2

4
9 7 9 7 10 4 3 9 4 8 10 5 6 3 8

Sample Output 2

15

update @ 2024/3/10 10:14:23