Given a positive integer $n \geq 2$. Let $a_{ij}$ $(1 \leq i,j \leq n)$ be $n^2$ non-negative reals and their sum is $1$. For $1\leq i \leq n$, define $R_i=max_{1\leq k \leq n}(a_{ik})$. For $1\leq j \leq n$, define $C_j=min_{1\leq k \leq n}(a_{kj})$ Find the maximum value of $C_1C_2 \cdots C_n(R_1+R_2+ \cdots +R_n)$