* Completed in: 1 day, 23 hrs, 21 secs.
* Check Loop Proof
1. (ac, bc) => (2ac, bc-ac) = (a, b) => (2a, b-a)
* a < b
1. (ac, bc+d) => (2ac, bc+d-ac) = (2ac, (b-a)c+d)
* a < b and 0 < d < c
1. (a, 2n-a) => (2a, 2n-2a) = (a, n-a)
* a < n
1. (x, y) will loop iff (x + y) % 2 == 1
* x and y are relative prime number
* Reference
* [Maximum Matching in General Graph](https://www.secmem.org/blog/2020/04/18/Blossom/)
