{"problem":{"name":"MUL","description":{"content":"We have $N$ gemstones labeled $1$ through $N$. You can perform the following operation any number of times (possibly zero). *   Select a positive integer $x$, and smash all the gems labeled with mult","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc085_c"},"statements":[{"statement_type":"Markdown","content":"We have $N$ gemstones labeled $1$ through $N$.\nYou can perform the following operation any number of times (possibly zero).\n\n*   Select a positive integer $x$, and smash all the gems labeled with multiples of $x$.\n\nThen, for each $i$, if the gem labeled $i$ remains without getting smashed, you will receive $a_i$ yen (the currency of Japan). However, $a_i$ may be negative, in which case you will be charged money.\nBy optimally performing the operation, how much yen can you earn?\n\n## Constraints\n\n*   All input values are integers.\n*   $1 \\leq N \\leq 100$\n*   $|a_i| \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ $...$ $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc085_c","tags":[],"sample_group":[["6\n1 2 -6 4 5 3","12\n\nIt is optimal to smash Gem $3$ and $6$."],["6\n100 -100 -100 -100 100 -100","200"],["5\n-1 -2 -3 -4 -5","0\n\nIt is optimal to smash all the gems."],["2\n-1000 100000","99000"]],"created_at":"2026-03-03 11:01:14"}}