OBM 2008 Problem 5

Prove that for all integers $a > 1$ and $b > 1$ there exists a function $f$ from the positive integers to the positive integers such that $f(a\cdot f(n)) = b\cdot n$ for all $n$ positive integer.