We need 3n−3≡0(mod7), i.e., 3n≡3(mod7), i.e., 3n−1≡1(mod7).
The order of 3 modulo 7: 31=3, 32=9≡2, 33=27≡6, 34=81≡4, 35=243≡5, 36=729≡1(mod7).
So 3n−1≡1(mod7) when 6∣(n−1), i.e., n≡1(mod6).
Values of n in [10,100] with n≡1(mod6):
n=13, 19, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97
Count: 697−13+1=684+1=14+1=15
The answer is 15.