Olympiad Number Theory · Superchallenge problem

How many ways are there to write $12$ as an ordered sum of positive integers in which every part is $1$ or $2$?