<｜begin▁of▁sentence｜>### Instruction:
Given the American College Football network contained in a file named football.gml, can you use the Louvain method from the cdlib library to detect communities, and then compute the fraction of nodes in each community having an internal degree that is higher than the median degree? You need to print the result.
### Response:
import networkx as nx
from cdlib import algorithms, evaluation

# Load the American College football network
G = nx.read_gml('football.gml')

# Detect communities using the Louvain method
communities = algorithms.louvain(G)

# Calculate the fraction of nodes in each community having an internal degree higher than the median degree
fomd = evaluation.fraction_over_median_degree(G, communities)

# Print the result
print(fomd)
<|EOT|>
