{"raw_statement":[{"iden":"problem statement","content":"Given is a permutation $P_1, \\ldots, P_N$ of $1, \\ldots, N$. Find the number of integers $i$ $(1 \\leq i \\leq N)$ that satisfy the following condition:\n\n*   For any integer $j$ $(1 \\leq j \\leq i)$, $P_i \\leq P_j$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $P_1, \\ldots, P_N$ is a permutation of $1, \\ldots, N$.\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$P_1$ $...$ $P_N$"},{"iden":"sample input 1","content":"5\n4 2 5 1 3"},{"iden":"sample output 1","content":"3\n\n$i=1$, $2$, and $4$ satisfy the condition, but $i=3$ does not - for example, $P_i > P_j$ holds for $j = 1$.  \nSimilarly, $i=5$ does not satisfy the condition, either. Thus, there are three integers that satisfy the condition."},{"iden":"sample input 2","content":"4\n4 3 2 1"},{"iden":"sample output 2","content":"4\n\nAll integers $i$ $(1 \\leq i \\leq N)$ satisfy the condition."},{"iden":"sample input 3","content":"6\n1 2 3 4 5 6"},{"iden":"sample output 3","content":"1\n\nOnly $i=1$ satisfies the condition."},{"iden":"sample input 4","content":"8\n5 7 4 2 6 8 1 3"},{"iden":"sample output 4","content":"4"},{"iden":"sample input 5","content":"1\n1"},{"iden":"sample output 5","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}