let make_list f t step =
  let rec make_list_inner c t lst =
    if c >= t then lst else make_list_inner (c+step) t (c::lst)
  in
  List.rev (make_list_inner f t [])

let sum list = List.fold_left (+) 0 list

let solve d =
  sum (List.map (fun x -> (x * d) * (x * d) * d) (make_list 1 (600/d) 1))
           
    
    
let () =
  let rec read () =
    try let ans = (Scanf.scanf "%d\n" solve) in
        Printf.printf "%d\n" ans;
        read ()
    with End_of_file ->
         ()
  in
  read ()
;;