Minimum Replacement Operations to Meet Target Sum

Problem Statement:

You are given an array of integers and a target sum (T). In one operation, you may replace any element of the array with any integer value. Your goal is to make the sum of the array equal to (T) using a minimum number of replacement operations.

If the current sum of the array already equals (T), no operations are needed. Otherwise, you can always achieve the target with just one replacement operation.

Note: The solution leverages the fact that one replacement is always sufficient to adjust the sum to (T) when the current sum is not already equal.

inputFormat

Input Format:

The first line contains a single integer (n), the number of elements in the array.
The second line contains (n) space-separated integers representing the elements of the array (A).
The third line contains a single integer (T), the target sum.

outputFormat

Output Format:

Output a single integer representing the minimum number of replacement operations required so that the sum of the array equals (T).## sample

3
1 2 3
6

0