{"problem":{"name":"031. 2001: A Space Odyssey","description":{"content":"While listening to an orchestra fail to play the music from 2001: A Space Odyssey, you wonder what the lowest positive number (other than one) that divides 2001 is. It turns out to be 3 (2001 = 3 * 66","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269031"},"statements":[{"statement_type":"Markdown","content":"While listening to an orchestra fail to play the music from 2001: A Space Odyssey, you wonder what the lowest positive number (other than one) that divides 2001 is. It turns out to be 3 (2001 = 3 * 667). Write a program to find this value for any composite number $n$.\n\nThe only line of input contains a single positive composite (not prime) integer $n$, greater than one: the number used in your calculations.\n\nOutput a single positive integer _k_: the smallest positive number (other than one) that divides $n$.\n\n## Input\n\nThe only line of input contains a single positive composite (not prime) integer $n$, greater than one: the number used in your calculations.\n\n## Output\n\nOutput a single positive integer _k_: the smallest positive number (other than one) that divides $n$.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be a composite integer such that $ n > 1 $.\n\n**Constraints**  \n$ n $ is composite and $ n > 1 $.\n\n**Objective**  \nFind the smallest integer $ k \\in \\mathbb{Z} $ such that $ k > 1 $ and $ k \\mid n $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269031","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}