#ifndef CGAL_USE_LEDA
#include <iostream>
int main(){ std::cout << "This demo needs LEDA" << std::endl; return 0;}
#else

#include <CGAL/basic.h> //CGAL definitions that need to be before anything else
#include <CGAL/Cartesian.h>
#include <CGAL/Quotient.h>
#include <CGAL/Arr_leda_segment_traits_2.h>
#include <CGAL/Bops/Polygons_bops_traits.h>
#include <CGAL/Polygons_bops_2.h>

#include <iostream>
#include <vector>
#include <list>

// uncomment if LEDA is installed.
//#include <CGAL/IO/cgal_window.h>  //used for visualization.
//#include <CGAL/IO/Pm_Window_stream.h>

typedef CGAL::Quotient<int>        NT;
typedef CGAL::Cartesian<NT>        K;
typedef K::Point_2                 Point_2;
typedef CGAL::Polygon_2<K>         Polygon_2;
typedef Polygon_2::Segment_2         Segment_2;

typedef CGAL::Polygons_bops_traits_2<K>   Bops_traits;

using std::cin; 
using std::cout; 
using std::endl;

void read_polygon(Polygon_2& polygon)
{  
  unsigned int n;  

  cin >> n;
  
  int    x, y;
  while (n--) {
    cin >> x >> y;
    polygon.push_back(Point_2(x,y));
  }
}

int  main()
{
  Polygon_2  poly1, poly2;
  
  read_polygon(poly1);
  read_polygon(poly2);
  
  cout<<"Polygons are"<<endl;
  cout<<poly1<<endl;
  cout<<poly2<<endl;
  
  std::list<Polygon_2>    polygons;
  std::list<Segment_2>    curves;
  std::list<Point_2>      points;
  
  CGAL::Polygons_do_intersect_2<Bops_traits> poly_do_intersect;
  
  if (poly_do_intersect(poly1,poly2))
    cout <<"The two input polygons do intersect"<<endl;
  else
    cout <<"The two input polygons do NOT intersect"<<endl;
  
 return 0;
}

#endif