{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"MD","content":"Zanite has come up with an interesting problem whose formal statement is as follows.\n\n---\n\nYou are given an array $a$ of $n$ integers $a_1, a_2, \\dots, a_n$. Initially, the score of each element is $0$.\n\nFor each pair $(i, j)$ such that $1 \\le i \u003c j \\le n$, you will do the following operation.\n\n- If $a_i$ divides $a_j$, then increment the score of $i$ by $1$.\n- If $a_j$ divides $a_i$, then increment the score of $j$ by $1$.\n\nFind the number of elements whose score is strictly less than $n - 1$.\n\n---\n\nZanite boasted that he could solve the problem in $\\mathcal{O}(n)$ time. However, you know that the problem can be solved much faster!\n\nTo prove your worth, Zanite has given to you an array $b$ of $m$ integers $b_1, b_2, \\dots, b_m$. He will ask you $q$ questions denoted by two integers $l$ and $r$, denoting that for this question, the array $a$ is the subarray of $b$ from $l$ to $r$ inclusive.\n\nCan you answer all of Zanite’s questions?"}},{"title":"Input","value":{"format":"MD","content":"The first line contains the integer $m \\ (1 \\le m \\le 10^5)$.\n\nThe second line contains $m$ integers $b_1, b_2, \\dots, b_m \\ (1 \\le b_i \\le 10^9)$.\n\nThe third line contains the integer $q \\ (1 \\le q \\le 10^5)$.\n\nThe next $q$ lines contain two integers $l$ and $r \\ (1 \\le l \\le r \\le m)$, denoting a question."}},{"title":"Output","value":{"format":"MD","content":"Output $q$ lines, each containing an integer, denoting the answer to each question."}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\n1 3 2 4 2\n4\n1 5\n2 5\n3 5\n4 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\n4\n1\n1\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"In the first question, the score of each element is $[4, 0, 2, 0, 2]$. Therefore, there are $4$ elements whose score is strictly less than $n - 1 \u003d 4$.\n\nIn the second question, the score of each element is $[0, 2, 0, 2]$. Therefore, there are $4$ elements whose score is strictly less than $n - 1 \u003d 3$."}}]}