Problem Statement

As a fun Friday activity, Harsh and Pranay decided to pay a ne game. The game begins with Harsh giving a list of n numbers to Pranay.

Help

All

$1$

$2$

$3$

In each iteration,

Pranay adds up all the numbers in the list and adds the m paints. Then, he returns the list of numbers to Hansh

In each iteration, Harsh performs the following actions

$1.$ If Harsh gets a list with only one number he throws for the game

$2.$ If Harsh gets a list consisting of more than one matche the list into two non$-$empty subsequences and gues subsequences to Pranay one by one

After Harsh and Pranay complete al total points

determine the m angs

Input Format

Constraints