
	 Define $\phi^!(n)$ as the product of all positive integers less than or equal to $n$ and relatively prime to $n$. Compute the remainder when \[ \sum_{\substack{2 \le n \le 50 \\ \gcd(n,50)=1}} \phi^!(n) \] is divided by $50$.

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