#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>ostream&operator<<(ostream &o,const vector<T>&t){o<<'[';FOR(i,t){if(i!=t.begin())o<<',';o<<*i;}return o<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)output(a[i],i!=n-1?',':10);}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}

const int MAX_N = 300000;
struct RMQ {
  int n;
  int dat[MAX_N * 2 - 1];
  void init(int _n) {
    for (n=1; n<_n; n*=2);
    fill(dat, dat+2*n-1, -INF);
  }
  void update(int k, int a) {
    k += n - 1;
    dat[k] = a;
    while(k>0) {
      k = (k-1) / 2;
      dat[k] = max(dat[k*2 + 1], dat[k*2 + 2]);
    }
  }
  int q(int a, int b) { return query(a, b, 0, 0, n); }
  int query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return -INF;
    if (a <= l && r <= b) return dat[k];
    return max(query(a, b, k*2+1, l, (l+r)/2),
               query(a, b, k*2+2, (l+r)/2, r));
  }
} rq;

ll a[1000000];
struct Query {
  int id,l,r,d;
  void in(int i) {
    id = i;
    input(l,r,d);
  }
  bool operator<(const Query &rhs) const {
    return d < rhs.d;
  }
} query[100000];

int ans[100000];
pii p[100000];
int n,Q;
void solve() {
  REP(i,n)p[i] = pii(a[i],i);
  sort(query,query+Q);
  sort(p,p+n);
  int idx = 0;
  rq.init(n);
  REP(i,Q) {
    while(idx < n && p[idx].first <= query[i].d) {
      rq.update(p[idx].second, p[idx].first);
      idx++;
    }
    chmin(ans[query[i].id], abs(query[i].d - rq.q(query[i].l, query[i].r+1)));
  }
}
int main() {
  while(cin >> n) {
    REP(i,n) input(a[i]);
    cin >> Q;
    REP(i,Q) {
      query[i].in(i);
      ans[i] = INF;
    }
    solve();
    REP(i,n) a[i] = -a[i];
    REP(i,Q) query[i].d = -query[i].d;
    solve();
    REP(i,Q) output(ans[i]);
  }
}


Measured memory_bytes: 7268