{"problem":{"name":"A. 2-3-numbers","description":{"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 thei","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF926A"},"statements":[{"statement_type":"Markdown","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_.\n\n## Input\n\nThe only line contains two integers _l_ and _r_ (1 ≤ _l_ ≤ _r_ ≤ 2·109).\n\n## Output\n\nPrint a single integer the number of _2-3-integers_ on the segment \\[_l_, _r_\\].\n\n[samples]\n\n## Note\n\nIn 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.","is_translate":false,"language":"English"}],"meta":{"iden":"CF926A","tags":["implementation","math"],"sample_group":[["1 10","7"],["100 200","5"],["1 2000000000","326"]],"created_at":"2026-03-03 11:00:39"}}