removing the numbers in array in special form

First, Ask user to create an array next, ask him/her to enter many numbers then, find a smallest number int the array after that, move the index of the smallest number in array three times forward then remove the number in current index and the index  when you arrive the end of the array and pass it move the index to the beginning of the array and if the beginning of the array had been removed . so, move the index just once to forward and do this while just one number hasn't been so print this number at last.

for Example:
Suppose user has opted the array with it's element which is below. we must do three steps:

first step:
Find the smallest number which is in this example (3) then move the index of the smallest number three times to forward then remove both the number in current index and the index which is (10) and do this while you arrived to the end of the array
note: When you arrived to the end of the array move the index of array to the beginning of that . and if the begging of the array had been removed, in this case you must move the index of array just once to forward

13

10

19

18

22

45

17

28

second step:
Continue the first Step but in this step we must not find the smallest number of array
note 1: When you arrive to the place of array that had been removed please underestimate to count this in the index movement.

13

10

19

18

45

17

Third step:
Continue the second step
note 1: When you arrive to the place of array that had been removed please underestimate to count this in the index movement.