*******************************
*** The hack uses generator ***
*******************************

** Command line arguments **
no arguments

** Generated test **


** Generator source **
def sum_of_subarrays(arr):
    total_sum = 0
    n = len(arr)
    for i in range(n):
        for j in range(i, n):
            total_sum += sum(arr[i:j+1])
    return total_sum

# Generating the largest test case based on a typical constraint
# WARNING: This code will almost certainly lead to TLE or memory errors for large enough n
import sys
n = 2000  # Example large n; adjust based on the specific problem's constraints and environment limits
test_case = list(range(1, n+1))

# Print the input size for clarity
print(len(test_case))

# Invoke the function and print the result
# This is expected to be very slow or to not complete within typical competitive programming time limits
result = sum_of_subarrays(test_case)
print(result)