Counting Functions gof=f

Let A={1,2,3,...,10} and f:A→A be defined as f(k)={

k+1	‌	‌ if ‌k‌ is odd ‌
k	‌	‌ if ‌k‌ is even ‌.

Then, the number of possible functions g:A→A, such that g∘f=f is