This is CFL , since u have to keep track of no of a's with no of b's , which can't be done by a finite automaton therefore u need to design a PDA for it. Changing $n >=1$ to $n >= 0$ can make it regular as then the given language will be reduced to $(a+b)^*$.