A frog is sitting on vertex A of a square ABCD. It starts jumping to the immediately adjacent vertex on either side in random fashion and stops when it reaches point C, in how many ways can it reach point C if it makes exactly 7 jumps?