Given a natural number \( n \), it is known that \( n \equiv 2 \pmod{3} \) and \( n \equiv 4 \pmod{5} \). Find the smallest positive \( n \) and determine the sum of its digits. Let's think step by step and output the final answer within \boxed{}.
user