# your code goes here
import sys

def solve():
    input = sys.stdin.read
    data = input().split()
    
    if not data:
        return

    N = int(data[0])
    numbers = [int(x) for x in data[1:N+1]]
    
  
    Q = int(data[N+1])
    
  
    pref = [0] * N
    pref[0] = numbers[0]
    for k in range(1, N):
        pref[k] = pref[k-1] + numbers[k]
        
   
    query_idx = N + 2
    output = []
    
    for _ in range(Q):
        i = int(data[query_idx])
        j = int(data[query_idx+1])
        query_idx += 2
        
        if i > j:
            i, j = j, i
            
       
        if i == 0:
            output.append(str(pref[j]))
        else:
            output.append(str(pref[j] - pref[i-1]))
            
   
    print('\n'.join(output) + '\n')

solve()