(quote1)(quote(1234))(atom(quote1))(atom(cons(quote1)(quote1)))(eq(cons(quote2)(quote3))(cons(quote2)(quote3)))(car(cons(cons(quote1)(quote2))(quote3)))(cdr(cons(cons(quote1)(quote2))(quote3)))(cond((eq(quote1)(quote1))(quote2))((quotet)(quote3)))(define inc (lambda(x)(cons(quote1) x)))(inc (quote(11)))(define append(lambda(x y)(cond((eq x nil) y)(t(cons(car x)(append(cdr x) y))))))(append(quote(123))(quote(4567)))(define f (lambda(x)(cons x (quote2))))(define g (lambda(f x)(f x)))(g f (quote3))
(defun two_count (a)(if(=(mod a 2)1)0(+(two_count (/ a 2))1)))(defun solve (n)(if(> n 0)(min(two_count (read))(solve (- n 1)))30))(princ(solve (read)))
(defun solve (a b c x)(if(> a 0)(+(solve (- a 1) b c x)(solve 0 b c (- x (*500 a))))(if(> b 0)(+(solve a (- b 1) c x)(solve a 0 c (- x (*100 b))))(if(> c 0)(+(solve a b (- c 1) x)(solve a b 0(- x (*50 c))))(if(= x 0)10)))))(princ(solve (read)(read)(read)(read)))
(defun digit_sum (n)(if(> n 0)(+(digit_sum (floor n 10))(mod n 10))0))(defun solve (n a b)(let((x (digit_sum n)))(if(> n 0)(+(solve (- n 1) a b)(if(and(<= a x)(<= x b)) n 0))0)))(princ(solve (read)(read)(read)))
(defun solve (s a)(if(equal a nil)1(+(solve (car a)(cdr a))(if(< s (car a))10))))(defun init (n)(if(> n 0)(append(init (- n 1))(list(read)))(list)))(let((a (sort(init (read))#'<)))(princ(solve (car a)(cdr a))))
(defun select (l1 l2)(if(>(car l1)(car l2)) l1 l2))(let((n (read))(y (read)))(defun solve1 (a b)(let((c (- n (+ a b))))(if(and(>= c 0)(=(+(*10000 a)(+(*5000 b)(*1000 c))) y))(list a b c)(if(> a 0)(select (solve1 (- a 1) b)(solve2 a b))(solve2 a b)))))(defun solve2 (a b)(let((c (- n (+ a b))))(if(and(>= c 0)(=(+(*10000 a)(+(*5000 b)(*1000 c))) y))(list a b c)(if(> b 0)(solve2 a (- b 1))(list-1-1-1)))))(formatt"~{~A~^ ~}"(solve1 n n)))
(defun solve (s)(let((n (length s)))(cond((and(>= n 5)(equal(subseq s (- n 5) n)"dream"))(solve (subseq s 0(- n 5))))((and(>= n 7)(equal(subseq s (- n 7) n)"dreamer"))(solve (subseq s 0(- n 7))))((and(>= n 5)(equal(subseq s (- n 5) n)"erase"))(solve (subseq s 0(- n 5))))((and(>= n 6)(equal(subseq s (- n 6) n)"eraser"))(solve (subseq s 0(- n 6))))((= n 0)"YES")(t"NO"))))(princ(solve (read-line)))
(defun calc (b)(let((ti (car b))(x (car(cdr b)))(y (car(cdr(cdr b)))))(if(and(=(mod ti 2)(mod(+(abs x)(abs y))2))(>= ti (+(abs x)(abs y))))01)))(defun solve (a)(if(=(loop for l in a sum (calc l))0)"Yes""No"))(defun init (n)(loop for i below n collect (list(read)(read)(read))))(defun delta (a)(loop for b on a collect
(if(null(cdr b))(car b)(diff (car b)(car(cdr b))))))(defun diff (s1 s2)(list(-(car s1)(car s2))(-(car(cdr s1))(car(cdr s2)))(-(car(cdr(cdr s1)))(car(cdr(cdr s2))))))(princ(solve (delta (reverse(init (read))))))