import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto X = new int[N];
      foreach (i; 0 .. N) {
        X[i] = readInt;
      }
      const Q = readInt;
      
      auto fs = new int[N];
      foreach (i; 0 .. N - 1) {
        fs[i + 1] = fs[i] + ((X[i] == X[i + 1]) ? 1 : 0);
      }
      
      auto freq = new int[N + 1];
      
      foreach (q; 0 .. Q) {
        const L = readInt - 1;
        const R = readInt;
        const S = readLong;
        
        const n = R - L;
        long calc(long k) {
          auto dp = new long[n + 1];
          dp[0] += 1;
          foreach (i; 0 .. n) {
            int now = 0;
            foreach (j; i .. n) {
              if (!freq[X[L + j]]++) ++now;
              if (now <= k) chmin(dp[j + 1] += dp[i], S + 1);
            }
            foreach (j; i .. n) {
              --freq[X[L + j]];
            }
          }
          debug {
            writefln("calc %s %s: %s", X[L .. R], k, dp);
          }
          return dp[n];
        }
        
        int ans;
        if (n-1 <= 60 && 1L << (n-1) <= S) {
          ans = -1;
        } else if (fs[R-1]-fs[L] <= 60 && 1L << (fs[R-1]-fs[L]) <= S) {
          if (n <= 100) {
            int lo = 1, hi = n + 1;
            for (; lo + 1 < hi; ) {
              const mid = (lo + hi) / 2;
              ((calc(mid) <= S) ? lo : hi) = mid;
            }
            ans = lo;
          } else {
            // fib > S
            ans = 1;
          }
        } else {
          ans = 0;
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}