middle me challenge written in clojure

middle-me.md

Challenge Write a function that will take a key of X and place it in the middle of Y repeated N times.

Rules: If X cannot be placed in the middle, return X. N will always be > 0.

(ns test.core
  (:gen-class))

(defn string-side [y n]
  (reduce str (repeat (/ n 2) y)))

(defn middle-me [x y n]
  (if (not= (mod n 2) 0)
    x
    (let [side (string-side y n)]
      (str side x side))))
    
    

(defn -main []
  (println (middle-me "*" "T" 4)))