A city would like to know how many vehicles it could move through its streets in an emergency. The most likely situation is an evacuation starting at the school and ending at the park. The connections between these two locations, plus their capacity and direction, is shown below.

$\backslash$ table $[[$ Path $,$ A $,$ B $,$ C $,$ D $,$ E $,$ F $,$ G $],[$ Capacity $,25,20,30,20,25,25,30]]$

Note: Round your answer to the nearest whole number.

Maximum flow