I've spent the last couple of hours trying to figure out this problems. For some of you it may be easy, but I'm kind of a noob in combinatorics. Do you have any ideas?

On an 8x8 chessboard a pawn is located in the upper-left corner and can only move one square at a time down or to the right. How many different ways are there for it to reach the lower-right corner without making three consecutive downward moves?