Simple Concept Tough Problem - 5

Hello readers ! We are at the fifth problem in the SCTP series. This problem had appeared in the PRMO 2018 paper. Here is the problem :
Integers satisfy
and
. Find the sum of all possible values of
.
We will see that this problem requires a basic property of divisibility of integers. If and
are integers such that
divides
and
divides
, then
. Please see the following video for the detailed solution.