Given a set of coins find the minimal amount that cannot be represented with this number of coins Input: First line: single integer N, the number of coins Second line: N integer numbers, representing corresponding coin values. Output: Single integer number - ammount that cannot be represented by the given set of coins Sample input: 3 1 2 5 Sample output: 4 Sample input: 5 1 2 4 7 16 Sample output: 15