Orientable ℤ_n-distance magic labeling of the cartesian product of two cycles

A directed ℤ_n-distance magic labeling of an oriented graph G→ = (V,A) of order n is a bijection l→: V → ℤ_n with the property that there exists µ ∈ ℤ_n (called the magic constant) such that If for a graph G there exists an orientation G→ such that there is a directed ℤ_n-distance magic labeling l→ for G→, we say that G is orientable ℤ_n-distance magic. In this paper, we prove that the Cartesian product of any two cycles is orientable ℤ_n-distance magic.