1046

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int d[maxn],a[maxn];
int main()
{
	int n,m,u,v,sum = 0;
	d[0] = 0;
		scanf("%d",&n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d",&d[i]);
		a[i+1] = a[i] +  d[i];
		sum += d[i];
	}
	scanf("%d",&m);
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&u,&v);
		if(u > v)
		{
			int temp = u;
			u = v;
			v = temp;
		}
		printf("%d\n",min(a[v]-a[u],(sum - (a[v]-a[u]))));
	}
	
	return 0;
}