You are in your kingdom with no troops but your barracks train **X** troops daily. Initially **X = 1**.↵
There are **N** neighbor kingdom each of which has **A[i]** amount of troops guarding it. To take over a kingdom you need to attack it with at least A[i] troops.↵
Once you capture a kingdom, as a consequence of war, all of your troops die (even if you attacked with > A[i] troops), and X increases by 1. Assuming Attacking and capturing a kingdom takes no time, find the minimum days the worthy king needs to wait to take over the entire globe.↵
↵
1 <= N <= 20↵
1 <= A[i] <= 1e6↵
↵
**Test Case 1:**↵
Input : A = [4 , 3 , 1]↵
Output : 4↵
↵
**Test Case 2:**↵
Input : A = [9 , 9]↵
Output : 14↵
There are **N** neighbor kingdom each of which has **A[i]** amount of troops guarding it. To take over a kingdom you need to attack it with at least A[i] troops.↵
Once you capture a kingdom, as a consequence of war, all of your troops die (even if you attacked with > A[i] troops), and X increases by 1. Assuming Attacking and capturing a kingdom takes no time, find the minimum days the worthy king needs to wait to take over the entire globe.↵
↵
1 <= N <= 20↵
1 <= A[i] <= 1e6↵
↵
**Test Case 1:**↵
Input : A = [4 , 3 , 1]↵
Output : 4↵
↵
**Test Case 2:**↵
Input : A = [9 , 9]↵
Output : 14↵
