jmc

Note that $7\equiv -6(\mathrm{mod}13)$, so we can write the given congruence as $6n\equiv -6(\mathrm{mod}13)$. Since 6 is relatively prime to 13, we can divide both sides by 6, to get $n\equiv -1\equiv \boxed{12}(\mathrm{mod}13)$.