Albert starts at the top left corner of a $16$ by $16$ grid and is allowed to move up, down, or right for each step. How many ways are there for him to reach the bottom right corner, given that no cell is traversed more than twice?