#include "bits/stdc++.h"
using namespace std;

using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 998244353;

template <typename T>
struct RMQ {
	int n;         // 葉の数
	vector<T> dat; // 完全二分木の配列
	RMQ(int n_) : n(), dat(n_ * 4, INF) { // 葉の数は 2^x の形
		int x = 1;
		while (n_ > x) {
			x *= 2;
		}
		n = x;
	}
	void update(int i, T x) {
		i += n - 1;
		dat[i] = x;
		while (i > 0) {
			i = (i - 1) / 2;  // parent
			dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
		}
	}
	// the minimum element of [a,b)
	T query(int a, int b) { return query_sub(a, b, 0, 0, n); }
	T query_sub(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l) {
			return INF;
		}
		else if (a <= l && r <= b) {
			return dat[k];
		}
		else {
			T vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
			T vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
			return min(vl, vr);
		}
	}
}; 
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll N; cin >> N;
	vector<P>p;
	for (int i = 0; i < N; i++) {
		ll X; cin >> X;
		p.push_back({ X, -i });
	}
	ll Q; cin >> Q;
	vector<ll>l(Q), r(Q);
	for (int i = 0; i < Q; i++) {
		cin >> l[i] >> r[i]; l[i]--;
		ll x; cin >> x;
		p.push_back({ x, i + 1 });
	}
	sort(p.begin(), p.end());
	vector<ll>ans(Q, INF);
	// まず, 集合Lについて試す
	RMQ<ll>rmq(N), rmq2(N);
	for (auto x : p) {
		if (x.second <= 0)rmq.update(-x.second, -x.first);
		else {
			ll idx = x.second - 1;
			ans[idx] = min(ans[idx], x.first + rmq.query(l[idx], r[idx]));
		}
	}
	
	reverse(p.begin(), p.end());
	for (auto x : p) {
		if (x.second <= 0)rmq2.update(-x.second, x.first);
		else {
			ll idx = x.second - 1;
			ans[idx] = min(ans[idx], rmq2.query(l[idx], r[idx]) - x.first);
		}
	}

	for (int i = 0; i < Q; i++) {
		cout << ans[i] << endl;
	}
	return 0;
}