s,i=input(),0
for x in input():i+=(x==s[i])
print(i+1)#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
int main()
{
string s1, s2; cin>>s1>>s2;
ll n1 = s1.size();
ll n2 = s2.size();
ll res = 0;
for(ll i =0; i<n2; i++)
{
if(s1[res] == s2[i]) res++;
}
cout<<res+1<<endl;
return 0;
}952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |