It is Turing complete. The details depend a bit on whether the tape and/or the numbers in the cells are unbounded. (If neither are, then even regular Brainfuck is not Turing complete.)
If the cells can hold unbounded integers, then we can easily use $k$ cells to simulate a $k$-counter machine. Those are Turing complete already for $k = 2$.
If the tape is infinite, we can simulate regular Brainfuck as follows. Partition the tape into pairs of cells, each of which simulates a single regular BF cell. The idea is that cell $2n$ contains a $1$ if the simulated pointer is at that pair and $0$ if not, and cell $2n+1$ holds the contents of the simulated cell. When we start to execute a simulated instruction, the pointer is on top of the $1$ at cell $2n$.
If we want to read or modify the current cell's value, just step right, perform the operation, return to the origin, and step 2 cells to the right until we see a $1$. If we want to take a step right, we decrement, move right twice, and increment.
The difficult part is moving the simulated pointer to the left. To do this, we return to the origin and increment. Now we have two simulated cells with a $1$ on the even part. Then we repeatedly move the leftmost $1$ one cell to the right (as if simulating a step to the right) until the next simulated cell also contains a $1$. In that case we break out of the loop, remove said $1$, return to the origin and walk to the remaining $1$ two steps at a time.