The Euclidean Algorithm is the oldest numerical algorithm still in use today. It is a fast, efficient method to find the Greatest Common Divisor $($gcd$)$ of two integers. Below are the calculations we discussed $($in class$)$ to find the gcd of $1785$ and $546.$ Looking at the calculations below, what is the ged of $1785$ and $546?$

Find ocd$(1785516)$