Sequencing Jobs Through Two Machines

Three jobs must each be processed first on Machine 1 and then on Machine 2, in that order. Each machine handles one job at a time, jobs cannot be preempted, and all jobs are available at time 0. Processing times (Machine 1, Machine 2) in minutes are: Job X = (3, 2), Job Y = (2, 4), Job Z = (4, 3). You may choose the order in which jobs enter the system (the same order is used on both machines). What is the minimum possible time at which all three jobs are completely finished?