#include <iostream>
using namespace std;
typedef long long int ll;

int main() {
	// your code goes here
	
	ll n;
	cin>>n;
	ll a[n+1];
	ll i;
	for(i=1;i<=n;i++)
	 {
	 	cin>>a[i];           
	 }
	 
	 ll dp[n+1]={0};
	 
	 dp[1]=a[1];   //base case
 	 dp[2]=a[1]+ a[2];
	 
	 i=3;
	 while(i<=n)
	  {
	  	
	  	dp[i]=dp[i-1]+a[i];    //0(N) time to cal all dp values
	  	i++;
	  }
	  
	  ll q;
	  cin>>q;
	  i=1;
	  while(i<=q)       //0(Q)
	   {
	   	 ll index;
	   	 cin>>index;
	   	 cout<<dp[index];  //0(1)
	   	 cout<<"\n";
	   	 i++;
	   }
	   
	   // tc-0(N+Q)
	
	return 0;
}