#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
#define endl '\n'
int N;//出口数量
int D[100010];
int M;
int pre[100010];//前缀和
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> D[i];
pre[i] = pre[i - 1] + D[i];
}
cin >> M;
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
if (a > b) {
swap(a, b);
}
int distance = pre[b-1] - pre[a-1];
distance = min(distance, pre[N]-distance);
cout << distance << endl;
}
return 0;
}