ed has five identical green marbles, and a large supply of identical red marbles. he arranges the green marbles and some of the red ones in a row and finds that the number of marbles whose right hand neighbor is the same color as themselves is equal to the number of marbles whose right hand neighbor is the other color. an example of such an arrangement is ggrrrggrg. let $m$ be the maximum number of red marbles for which such an arrangement is possible, and let $n$ be the number of ways he can arrange the $m 5$ marbles to satisfy the requirement. find the remainder when $n$ is divided by $1000$.