给定一个长度为 $N$ 的序列 $A_1, A_2, \ldots, A_N$。请编写程序执行以下查询：
i j：输出 $A_i, A_{i+1}, \ldots, A_j$ 中出现次数最多的数的出现次数。第一行包含序列的长度 $N$ $(1 \le N \le 100{,}000)$。
第二行包含 $A_1, A_2, \ldots, A_N$ $(1 \le A_i \le 100{,}000)$。
第三行包含查询的个数 $M$ $(1 \le M \le 100{,}000)$。
接下来 $M$ 行，每行包含一个查询 $i, j$ $(1 \le i \le j \le n)$。
对于每个查询，输出一行答案。
5 1 2 1 3 3 3 1 3 2 3 1 5
2 1 2
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: