#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;
int main() {
int m;
cin >> m;
vector<int> a(m,0), b(m,0), c(m,0);
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i] >> c[i];
}
vector<vector<int>>dp(m, vector<int>(2, 0));
dp[0][0] = 300000;
dp[0][1] = b[0];
for (int i = 1; i < m; i++) {
dp[i][0] = std::min(dp[i - 1][0] + a[i], dp[i - 1][1] + c[i] + a[i]);
dp[i][1] = std::min(dp[i - 1][1] + b[i], dp[i - 1][0] + c[i] + b[i]);
}
cout << std::min(dp[m-1][0],dp[m-1][1]);
}