In this Kata, you will be given an integer array and your task is to return the sum of elements occupying prime-numbered indices. 
~~~if-not:fortran
The first element of the array is at index `0`.
~~~
~~~if:fortran
The first element of an array is at index `1`.
~~~
Good luck! 
If you like this Kata, try:
[Dominant primes](https://www.codewars.com/kata/59ce11ea9f0cbc8a390000ed). It takes this idea a step further.
[Consonant value](https://www.codewars.com/kata/59c633e7dcc4053512000073)
def total(arr):
    fin_arr = []
    for i in range(2, len(arr)):
        d = 2
        while i % d != 0:
            d += 1
        if d == i:
            fin_arr.append(arr[i])
    n = sum(fin_arr)
    return n
def total(arr):
    fin_arr = []
    for i in range(2, len(arr)):
        d = 2
        while i % d != 0:
            d += 1
        if d == i:
            fin_arr.append(arr[i])
    n = sum(fin_arr)
    return n