When we write the number $n > 2$ as the sum of some integers consecutive positives (at least two addends), we say that we have an elegant decomposition of $n$. Two elegant decompositions will be different if any of them contains some term that does not contains the other. How many different elegant decompositions does the number $3^{2004}$ have?