algorithm complexity , solving recursive equation

algorithm complexity , solving recursive equation

I am a student at University of Tehran and this semester I've taken a Data
Structures and Algorithm course . anyway not to bore you with details ,
for solving complexity for an algorithm , I'm stuck in this recursive
equation :
T(n) = logn*T(logn) + n
obviously this cant be handled with the use of the Master Theorem , so I
was wondering if anybody has any ideas for solving this recursive equation
. P.S. : I'm pretty sure that it should be solved with a change in the
parameters , like considering n to be 2^m , but I couldn't manage to find
any good fix . anyways , thanks for your help in advance