Evin and Jerry are playing a game with a pile of marbles. On each player's turn, they can remove $2$, $3$, $7$, or $8$ marbles. If they can't make a move because there's $0$ or $1$ marble left, they lose the game. Given that Evin goes first and both players play optimally, for how many values of $n$ from $1$ to $1434$ does Evin lose the game?

Let's think step by step and output the final answer within \boxed{}.
user