#include <bits/stdc++.h>
using namespace std;
bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }
int Set(int N, int pos) { return N = N | (1 << pos); }
int fx[] = {+0, +0, +1, -1, -1, +1, -1, +1};
int fy[] = {-1, +1, +0, +0, +1, +1, -1, -1};
int hr[] = {-2, -2, -1, +1, +2, +2, -1, +1};
int hc[] = {+1, -1, +2, +2, -1, +1, -2, -2};
int dx[] = {+1, -1, +0, +0};
int dy[] = {+0, +0, +1, -1};
const int MAXN = (int)1e5 + 9;
long long ara[MAXN], pre[MAXN];
int main() {
  long long i, j, k, l, m, n, p, q, x, y, u, v, r, tc, t;
  cin >> n;
  for (int i = 1; i <= (int)n; i++) {
    cin >> ara[i];
  }
  pre[0] = 0;
  for (int i = 1; i <= (int)n; i++) {
    pre[i] = pre[i - 1] + ara[i];
  }
  cin >> q;
  while (q--) {
    cin >> l >> r;
    long long sum = pre[r] - pre[l - 1];
    cout << sum / 10 << endl;
  }
  return 0;
}
