Prime Jumps

You are given an integer array arr of length n. You start at index 0 and must end at index n-1.

From index i, you may jump to:

• i + 1, or
• i + p where p is a prime number and p % 10 == 3 (e.g., 3, 13, 23, 43, ...), and i + p < n.

Your score is the sum of arr values on all visited indices (including start and end).

Task: Return the maximum achievable score when reaching n-1. If n-1 is unreachable, return -1.