{"raw_statement":[{"iden":"statement","content":"A positive integer is called a _2-3-integer_, if it is equal to 2_x_·3_y_ for some non-negative integers _x_ and _y_. In other words, these integers are such integers that only have 2 and 3 among their prime divisors. For example, integers 1, 6, 9, 16 and 108 — are 2-3 integers, while 5, 10, 21 and 120 are not.\n\nPrint the number of _2-3-integers_ on the given segment \\[_l_, _r_\\], i. e. the number of sich _2-3-integers_ _t_ that _l_ ≤ _t_ ≤ _r_."},{"iden":"input","content":"The only line contains two integers _l_ and _r_ (1 ≤ _l_ ≤ _r_ ≤ 2·109)."},{"iden":"output","content":"Print a single integer the number of _2-3-integers_ on the segment \\[_l_, _r_\\]."},{"iden":"examples","content":"Input\n\n1 10\n\nOutput\n\n7\n\nInput\n\n100 200\n\nOutput\n\n5\n\nInput\n\n1 2000000000\n\nOutput\n\n326"},{"iden":"note","content":"In the first example the _2-3-integers_ are 1, 2, 3, 4, 6, 8 and 9.\n\nIn the second example the _2-3-integers_ are 108, 128, 144, 162 and 192."}],"translated_statement":[{"iden":"statement","content":"一个正整数被称为 _2-3整数_，如果它等于 $2^x \\cdot 3^y$，其中 $x$ 和 $y$ 是某些非负整数。换句话说，这些整数的素因子中仅包含 $2$ 和 $3$。例如，整数 $1$、$6$、$9$、$16$ 和 $108$ 是 2-3 整数，而 $5$、$10$、$21$ 和 $120$ 不是。\n\n请输出给定区间 $[l, r]$ 上 _2-3整数_ 的数量，即满足 $l \\leq t \\leq r$ 的 _2-3整数_ $t$ 的个数。\n\n输入仅一行，包含两个整数 $l$ 和 $r$（$1 \\leq l \\leq r \\leq 2 \\cdot 10^9$）。\n\n请输出一个整数，表示区间 $[l, r]$ 上 _2-3整数_ 的数量。\n\n在第一个例子中，_2-3整数_ 是 $1$、$2$、$3$、$4$、$6$、$8$ 和 $9$。\n\n在第二个例子中，_2-3整数_ 是 $108$、$128$、$144$、$162$ 和 $192$。"},{"iden":"input","content":"输入仅一行，包含两个整数 $l$ 和 $r$（$1 \\leq l \\leq r \\leq 2 \\cdot 10^9$）。"},{"iden":"output","content":"请输出一个整数，表示区间 $[l, r]$ 上 _2-3整数_ 的数量。"},{"iden":"examples","content":"输入\n1 10\n输出\n7\n\n输入\n100 200\n输出\n5\n\n输入\n1 2000000000\n输出\n326"},{"iden":"note","content":"在第一个例子中，_2-3整数_ 是 $1$、$2$、$3$、$4$、$6$、$8$ 和 $9$。在第二个例子中，_2-3整数_ 是 $108$、$128$、$144$、$162$ 和 $192$。"}],"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S = \\{ 2^x \\cdot 3^y \\mid x, y \\in \\mathbb{Z}_{\\geq 0} \\} $ be the set of 2-3-integers.\n\n**Constraints**  \nGiven integers $ l, r \\in \\mathbb{Z} $ such that $ 1 \\leq l \\leq r \\leq 2 \\cdot 10^9 $.\n\n**Objective**  \nCompute $ \\left| S \\cap [l, r] \\right| $.","simple_statement":null,"has_page_source":false}