MUL

AtCoder

IDarc085_c

Time2000ms

Memory256MB

Difficulty—

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 multiples of $x$. Then, 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. By optimally performing the operation, how much yen can you earn? ## Constraints * All input values are integers. * $1 \leq N \leq 100$ * $|a_i| \leq 10^9$ ## Input Input is given from Standard Input in the following format: $N$ $a_1$ $a_2$ $...$ $a_N$ [samples]

Samples

Input #1

6
1 2 -6 4 5 3

Output #1

12

It is optimal to smash Gem $3$ and $6$.

Input #2

6
100 -100 -100 -100 100 -100

Output #2

Input #3

5
-1 -2 -3 -4 -5

Output #3

0

It is optimal to smash all the gems.

Input #4

2
-1000 100000

Output #4

API Response (JSON)

{
  "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 mult...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments