#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod1 = 998244353;
const double pie = 3.1415926535;
unsigned long long power(unsigned long long x, unsigned long long y) {
  if (y == 0)
    return 1;
  else {
    if (y % 2 == 0)
      return power(x * x, y / 2);
    else
      return x * power(x * x, (y - 1) / 2);
  }
}
long long mod_power(long long x, long long y, long long m) {
  long long r = 1;
  x = x % m;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) r = (r * x) % m;
    y = y / 2;
    x = (x * x) % m;
  }
  return r;
}
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int TESTS = 1;
  while (TESTS--) {
    int n;
    cin >> n;
    vector<long long> v(n);
    for (int i = 0; i < n; i++) cin >> v[i];
    vector<long long> presum(n + 1, 0);
    presum[1] = v[0];
    for (int i = 1; i < n; i++) presum[i + 1] = v[i] + presum[i];
    int q;
    cin >> q;
    while (q--) {
      int l, r;
      cin >> l >> r;
      cout << (presum[r] - presum[l - 1]) / 10 << '\n';
    }
  }
}
