Largest Remainder from

Modulo

What is the largest remainder possible for modulo division of $x\%n?$

$n-1$

n

This is impossible to know without knowing $$e specific values of $x$ and n$.$

$1$