Topological ordering

Consider the following directed graph:

• The graph contains the nodes $1,2,\dots,N$ and $N=1000$.
• There is an edge from the node $a$ to the node $b$ if $a<b$.

How many different topological orderings does the graph have?

Justify your answer briefly: