write a python script that finds stopping time of the collatz conjecture
The Collatz Conjecture is a mathematical sequence defined as follows: 

1. Start with any positive integer \( n \).
2. If \( n \) is even, divide it by 2.
3. If \( n \) is odd, multiply it by 3 and add 1.
4. Repeat the process indefinitely.

The conjecture states that no matter what value of \( n \) you start with, you will eventually reach the number 1.

Below is a Python script that computes the stopping time of the Collatz Conjecture for a given positive integer. The stopping time is defined as the number of steps it takes to reach 1.

```python
def collatz_stopping_time(n):
    if n <= 0:
        raise ValueError("Input must be a positive integer.")
    
    steps = 0
    while n != 1:
        if n % 2 == 0:  # n is even
            n = n // 2
        else:           # n is odd
            n = 3 * n + 1
        steps += 1
    return steps

if __name__ == "__main__":
    try:
        number = int(input("Enter a positive integer: "))
        stopping_time = collatz_stopping_time(number)
        print(f"The stopping time for {number} is {stopping_time}.")
    except ValueError as e:
        print(e)
```

### How
def stop_time(n):
    if n == 1:
        return 0
    elif n % 2 == 0:
        return n//2
    else:
        return 3*ceil(sqrt(n)) + 1

n = 1000000

print("Stop time of Collatz Conjecture for", n, "is", stop_time(n))