#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma warning(disable:4996) //#define ATCODER #ifdef ATCODER #include #endif typedef long long ll; typedef unsigned long long ull; #define LINF 9223300000000000000 #define LINF2 1223300000000000000 #define LINF3 1000000000000 #define INF 2140000000 //const long long MOD = 1000000007; const long long MOD = 998244353; using namespace std; #ifdef ATCODER using namespace atcoder; #endif char str[300005]; void solve() { int n; scanf("%d%s", &n, str); int ans = 0; int pre = 0; for (int i = n - 1; i >= 0; i--) { if (str[i] == '#') { ans = max(ans, pre + n - i); pre++; } else { pre--; } pre = max(pre, 0); ans = max(ans, pre); } printf("%d\n", ans); return; } int main() { #if 1 solve(); #else int T, t; scanf("%d", &T); for (t = 0; t < T; t++) { //printf("Case #%d: ", t + 1); solve(); } #endif return 0; }