Subarray Split

Given an array of integers, you need to determine the number of ways to split the array into two non-empty subarrays such that the sum of the first subarray is equal to the sum of the second subarray. Input Format: - The first line contains an integer `n`, the length of the array. - The second line contains `n` integers, the elements of the array. Output Format: - A single integer representing the number of ways to split the array based on the above condition. Constraints: - 1 <= n <= 1000 - -1000 <= array elements <= 1000 Example: Input: 4 1 2 1 2 Output: 1