/* Skeleton and driver for Leetcode 2477: Minimum Fuel Cost to Report to the Capital */

#include <string>
#include <vector>
#include <list>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
using namespace std;

class Solution {
public:
    long long minimumFuelCost(vector <vector <int> > &roads, int seats);
};

long long Solution::minimumFuelCost(vector <vector <int> > &roads, int seats)
{
  return 0;
}

int main()
{
  vector <int> p;
  vector < vector <int> > roads;
  int seats;
  Solution s;

  /* Read in the edges, and then the seats.  Create the roads vector from the edges. */

  p.resize(2);
  while (cin >> seats) {
    if (cin >> p[1]) {
      p[0] = seats;
      roads.push_back(p);
    }
  }

  /* Print the solution */

  cout << s.minimumFuelCost(roads, seats) << endl;
  return 0;
}