#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int arr[N];
int main(){
int n,m;
cin>>n;
for (int i = 1; i <= n; i ++ ){
cin>>arr[i];
}
for (int i = 1; i <= n; i ++ ){
arr[i]+=arr[i-1];
}
cin>>m;
while (m -- ){
int a,b;
cin>>a>>b;
if(a>b)
swap(a,b);
cout<<min(arr[b-1]-arr[a-1],arr[n]-(arr[b-1]-arr[a-1]))<<endl;
}
return 0;
}