Particularly Tricky Recurrence Relation (Master's Theorem)
Since n refers to "the length in bits of x", you should translate n with the binary log of x, and (n-2) with the binary log of x/4.

Hope it helps.