Question

volunteered himse n activity called the "Adjacent Stick Game"
where sticks of dinlength will be placed in a line and Mukesh
needs to remove a stick from each adjacent pair of sticks. He then has
to form a bigger stick by combining all the remaining sticks.
Mukesh needs to know the smallest length of the bigger stick so
formed and needs your help to compute the same. Given the number of
sticks N and the lengths of each of the sticks, write a program to find
the smallest length of the bigger stick that is formed.
Input format
First line of input contains an integer N denoting the number of sticks.
Assume that the maximum value for N as 50.
Assume that N is always even.​

Answer 1

Answer:

gdfiighd hvcbk vkc hjx