Somehow you find yourself planning a golf cart road trip through the Prime Plains

These plains are known to be a bit odd, and you know you will be able to refuel your cart along the way

You know you will start your travels at mile marker $0$

You also know that your cart always uses exactly $2125$ units of fuel per mile traveled

These are highly scientific golf cart fuel measurements of course

As you pass any $OD{D}_{?}$ prime number $,)$ mile marker, let's call it $n,$ your will add $n$ units of fuel to the cart for free

For example, when you hit mile $11,$ you will add $11$ units of fuel to the cart

At no time between mile markers can you ever get out of the cart, for reasons let's say

Imagine whatever you'd like

You may use $\frac{C}{C}++,$ Python, $CH,$ or Java to solve the problem with the previously described constraints

I highly recommend using $C++$ even if you haven't worked too much with it in the past

This is because $Ct+$ is a low$-$level language most closely related to $86$ assembly language

There is no need to set up an IDE for this one problem, since you can use a website like ideone com for this if you so choose

However, I want you to submit your one, unzipped, plain text source code file to Blackboard when complete

Part $1$ get stranded in the Prime plains? Trial and error can help lead the way if you don't work it out mathematically first.

Part $2$ This is just a reference to assist you in figuring out the logic and expected output of the problem.

NOTE