/*
	author :hzoi_ztx
	title  :cogs 36. 求和问题
	ALG    :树状数组 
	CMT    :

	[2014 10 23]
*/

#include <cstdio>

#define  maxn  10010
#define  lowbit(x) x&(-x)

int n , m ;
int C[maxn] = {0} ;

void insert(int p, int d) {
	while (p <= n) {
		C[p] += d ;
		p += lowbit(p) ;
	}
}

int query(int p) {
	int ret = 0 ;
	while (p) {
		ret += C[p] ;
		p -= lowbit(p) ;
	}
	return ret ;
}

int main() {
	#define READ
	#ifdef  READ
		freopen("sum.in" ,"r",stdin ) ;
		freopen("sum.out","w",stdout) ;
	#endif
	int i , x , y ;
	scanf("%d", &n ) ;
	for (i = 1 ; i <= n ; i ++ ) {
		scanf("%d", &x ) ;
		insert(i , x) ;
	}
	scanf("%d", &m ) ;
	for (i = 1 ; i <= m ; i ++ ) {
		scanf("%d%d", &x , &y ) ;
		printf("%d\n", query(y)-query(x-1) ) ;
	}
	#ifdef  READ
		fclose(stdin ) ;
		fclose(stdout) ;
	#endif
	return 0 ;
}