You are given an array target of n integers.

Starting from an array arr of size n where every element is 1, you may perform the following operation any number of times:

• Let x be the sum of all current elements in arr.

• Pick an index i and set arr[i] = x.

Your task is to return True if it’s possible to construct target from arr, otherwise return False.

Constraints:

• n == target.length

• $1 \leq$ n $\leq 1000$

• $1 \leq$ target[i] $\leq 10^5$