{"code":"icpc21specialnumber","name":"Special Number","description":"A number is special if the sum of its digits is a prime number. Given an integer $N$, count the number of positive integer\r\npairs $(x, y)$ where both $x$ and $y$ are special and $x + 2y = N$.\r\n\r\n<h4>Input</h4>\r\n\r\n- The first line of input contains the one integer $N (1 \\le  N \\le  10^{15})$.\r\n\r\n<h4>Output</h4>\r\n\r\n- Output a single number, the number of satisfied pairs.\r\n\r\n<h4>Example</h4>\r\n\r\n!!! question \"Test 1\"\r\n\r\n    ???+ \"Input\"\r\n        ```sample\r\n        100\r\n        ```\r\n    \r\n    ???+ success \"Output\"\r\n        ```sample\r\n        7\r\n        ```","points":400.0,"partial":false,"time_limit":1.0,"memory_limit":262144,"short_circuit":false,"allowed_languages":[3,4,34,36,37,5,6,11,12,14,28,2,38,39,9,18,17,29,23,27,35,25,26,10,7,19,32,1,8,15,16,24,20,33,13,41,21,40],"is_public":true,"is_manually_managed":false,"permissions":{"can_edit":false}}