Anthrax: thank you! 
SpaceXGeek:
As Melody mentioned, the main point of this solution is for you to learn something.
If I give you a similar problem, would you be able to solve it?
Here's a similar problem to check your understanding:
Suppose we have positive integers a, b, c such that , then can you find the remainder when a + b + c is divided by 11?
Remarks and some hints: When you only have ab, bc, ca and abc in an equation (or congruence, in this case), it is sometimes useful to consider 1/a, 1/b, 1/c. Here, I had to make sure that 1/a, 1/b, and 1/c "makes sense" under mod 13, so I pointed out that 13 is a prime. The simplification step is actually Gaussian elimination, if you have learnt linear algebra. Otherwise, you can use method of elimination to solve it. You can invert an integer a mod p by calculating . This congruence comes from Fermat's little theorem.