// C++ implementation of the approach 
#include <bits/stdc++.h> 
using namespace std; 

// Function to return the number of regions in a Planar Graph 
int Regions(int Vertices, int Edges) 
{ 
	int R = Edges + 2 - Vertices; 

	return R; 
} 

// Driver code 
int main() 
{ 
	int V = 5, E = 7; 

	cout << Regions(V, E); 

	return 0; 
}