#include <bits/stdc++.h>
using namespace std;
unordered_set<int> sets;
int n;
int main() {
  int left = 0, right = 0;
  cin >> n;
  string s;
  cin >> s;
  for (auto ch : s) {
    ch == 'L' ? left++ : right++;
  }
  int count = left + right + 1;
  cout << count << endl;
  return 0;
}
