Let m, n ∈ N and gcd (2, n )=1. If 30 30 0 +29 30 1 +…..+2 30 28 +1 30 29 = n · 2^m, then n + m is equal to \ \ \ \. ( Here n k =^n C_k )

Let $\displaystyle \mathrm{m}, \mathrm{n} \in \mathbf{N}$ and $\displaystyle \operatorname{gcd}(2, \mathrm{n})=1$. If $\displaystyle 30\binom{30}{0}+29\binom{30}{1}+\ldots . .+2\binom{30}{28}+1\binom{30}{29}=\mathrm{n} \cdot 2^{\mathrm{m}}$, then $\displaystyle \mathrm{n}+\mathrm{m}$ is equal to \_\_\_\_. $$\left(\text { Here }\binom{\mathrm{n}}{\mathrm{k}}={ }^{\mathrm{n}} \mathrm{C}_{\mathrm{k}}\right) $$