Edges of Bipartite

Let |V|=1000, and assume W a subset of V is selected at random from the collection of all subsets of V. Let us form the complete bipartite graph G with parts W and V\W (in other words, we connect two vertices if and only if one of them is in W while another is not). What is the expected number of edges in G? Round to an integer if needed.