Create a Python script that utilizes the Memcached caching system to cache the results of expensive calculations, such as Fibonacci numbers or prime numbers. The script should check if the result is already cached before performing the calculation, and if not, perform the calculation, cache the result, and return it.
PLAINFORMAT
import memcache

# Connect to the Memcached server
mc = memcache.Client(['127.0.0.1:11211'], debug=0)

def fibonacci(n):
    # Check if the result is already cached
    fib_n = mc.get(f'fibonacci_{n}')
    
    if fib_n is not None:
        return fib_n
    
    # If not cached, perform the calculation
    if n <= 1:
        fib_n = n
    else:
        fib_n = fibonacci(n - 1) + fibonacci(n - 2)
        
    # Cache the result and return it
    mc.set(f'fibonacci_{n}', fib_n)
    return fib_n

if __name__ == '__main__':
    num = int(input("Enter a number: "))
    print(f"Fibonacci({num}) = {fibonacci(num)}")