How to I find time complexity for the following code?

sum `j` from `j=n` to `n/(3^(j-1))`

this is the pseudocode from which I got the summation. 

```
j=n
while (j>=1)
  for (i=1 to n)
    x=x+1
  j=j/3
}

```