(defun REVERSE1 (l)
(cond((null l) nil)
(t (append (REVERSE1 (cdr l))
(cons (car l) nil)))))

(defun delete_end(list)
(cond
((null (cdr list)) nil)
(t (cons (car list) (delete_end (cdr list))))))



(defun F (L)

(if L

(if (cdr L)

(cons

(* (car L) (car (REVERSE1 L)))

(F (cdr (delete_end L))))

L)))

(setq d'(1 2 3 4 5 6))

(princ (F d))