### Task
Your main goal is to find two numbers(` >= 0 `), greatest common divisor of wich will be `divisor` and number of iterations, taken by Euclids algorithm will be `iterations`.
### Euclid's GCD
```CSharp
BigInteger FindGCD(BigInteger a, BigInteger b) {
  // Swaping `a` and `b`
  if (a < b) {
    a += b;
    b = a - b;
    a = a - b;
  }
  while (b > 0) {
    // Iteration of calculation
    BigInteger c = a % b;
    a = b;
    b = c;
  }
  // `a` - is greates common divisor now
  return a;
}
```
### Restrictions
Your program should work with numbers
`0 < divisor < 1000`
`0 <= iterations <= 50'000`
def find_initial_numbers (divisor, iterations):
    a, b = divisor, 0
    for _ in range(iterations + (1 if iterations else 0)):
        a, b = a + b, a
    return a, b
def find_initial_numbers (divisor, iterations):
    a, b = divisor, 0
    for _ in range(iterations + (1 if iterations else 0)):
        a, b = a + b, a
    return a, b