Let \( A = \{1, 2, 3, \ldots, 100\} \). Let \( R \) be a relation on \( A \) defined by \( (x, y) \in R \) if and only if \( 2x = 3y \). Let \( R_1 \) be a symmetric relation on \( A \) such that \( R \subset R_1 \) and the number of elements in \( R_1 \) is \( n \). Then, the minimum value of \( n \) is \(\_\_\_\_\_\).