Ryan Alweiss storms into the Fine Hall common room with a gigantic eraser and erases all integers $n$ in the interval $[2, 728]$ such that $3^t$ doesn’t divide $n!$, where $t = \left\lceil \frac{n-3}{2} \right\rceil$. Find the sum of the leftover integers in that interval modulo $1000$.

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