Parthib and Naeem are playing a fun game. They have $n$ cards in front of them. Naeem or Parthib can take $1$ or $3$ cards per turn. The one who can take the last card will be the winner of the game. If Naeem takes the first turn, find the sum of the possibile values of $n$ such that Naeem has a winning strategy. $(n\le1000)$